./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 01:56:34,299 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:56:34,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:56:34,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:56:34,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:56:34,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:56:34,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:56:34,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:56:34,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:56:34,385 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:56:34,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:56:34,386 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:56:34,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:56:34,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:56:34,387 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:56:34,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:56:34,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:56:34,387 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:56:34,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:56:34,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:56:34,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:56:34,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:56:34,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:56:34,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:56:34,388 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:56:34,388 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:56:34,388 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:56:34,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:56:34,388 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:56:34,388 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:56:34,389 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:56:34,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:56:34,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:56:34,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:56:34,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:56:34,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:56:34,389 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:56:34,389 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:56:34,389 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:56:34,389 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:56:34,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:56:34,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:56:34,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:56:34,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:56:34,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:56:34,390 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 133ba40f5b51c272364c51a4e246bcd97a40cd88b0bcd4bd92df8f8d6bb23a52 [2025-03-09 01:56:34,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:56:34,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:56:34,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:56:34,613 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:56:34,613 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:56:34,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2025-03-09 01:56:35,741 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92c0f074a/b12deafdae7942a7a03b18fa2ab6bf20/FLAG37d92b4b4 [2025-03-09 01:56:35,982 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:56:35,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/apache-get-tag.i.v+lhb-reducer.c [2025-03-09 01:56:35,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92c0f074a/b12deafdae7942a7a03b18fa2ab6bf20/FLAG37d92b4b4 [2025-03-09 01:56:36,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92c0f074a/b12deafdae7942a7a03b18fa2ab6bf20 [2025-03-09 01:56:36,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:56:36,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:56:36,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:56:36,021 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:56:36,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:56:36,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:56:36" (1/1) ... [2025-03-09 01:56:36,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e802f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36, skipping insertion in model container [2025-03-09 01:56:36,025 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:56:36" (1/1) ... [2025-03-09 01:56:36,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:56:36,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:56:36,190 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:56:36,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:56:36,235 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:56:36,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36 WrapperNode [2025-03-09 01:56:36,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:56:36,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:56:36,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:56:36,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:56:36,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36" (1/1) ... [2025-03-09 01:56:36,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36" (1/1) ... [2025-03-09 01:56:36,270 INFO L138 Inliner]: procedures = 14, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 288 [2025-03-09 01:56:36,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:56:36,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:56:36,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:56:36,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:56:36,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36" (1/1) ... [2025-03-09 01:56:36,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36" (1/1) ... [2025-03-09 01:56:36,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36" (1/1) ... [2025-03-09 01:56:36,301 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 01:56:36,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36" (1/1) ... [2025-03-09 01:56:36,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36" (1/1) ... [2025-03-09 01:56:36,309 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36" (1/1) ... [2025-03-09 01:56:36,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36" (1/1) ... [2025-03-09 01:56:36,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36" (1/1) ... [2025-03-09 01:56:36,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36" (1/1) ... [2025-03-09 01:56:36,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:56:36,320 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:56:36,320 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:56:36,320 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:56:36,321 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36" (1/1) ... [2025-03-09 01:56:36,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:56:36,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:36,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 01:56:36,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 01:56:36,371 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-09 01:56:36,371 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-09 01:56:36,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:56:36,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:56:36,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:56:36,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:56:36,431 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:56:36,432 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:56:36,679 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L192: havoc main_~main____CPAchecker_TMP_7~0#1;havoc main_~__tmp_10~0#1, main_~__VERIFIER_assert__cond~9#1;havoc main_~__tmp_9~0#1, main_~__VERIFIER_assert__cond~8#1; [2025-03-09 01:56:36,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L77: havoc main_~__tmp_4~0#1, main_~__VERIFIER_assert__cond~3#1;havoc main_~__tmp_3~0#1, main_~__VERIFIER_assert__cond~2#1; [2025-03-09 01:56:36,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L29: havoc main_~main____CPAchecker_TMP_0~0#1; [2025-03-09 01:56:36,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L302: havoc main_~__tmp_16~0#1, main_~__VERIFIER_assert__cond~15#1;havoc main_~__tmp_15~0#1, main_~__VERIFIER_assert__cond~14#1; [2025-03-09 01:56:36,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L229: havoc main_~__tmp_12~0#1, main_~__VERIFIER_assert__cond~11#1;havoc main_~__tmp_11~0#1, main_~__VERIFIER_assert__cond~10#1;havoc main_~main____CPAchecker_TMP_6~0#1; [2025-03-09 01:56:36,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: havoc main_~main____CPAchecker_TMP_5~0#1;havoc main_~__tmp_6~0#1, main_~__VERIFIER_assert__cond~5#1;havoc main_~__tmp_5~0#1, main_~__VERIFIER_assert__cond~4#1;havoc main_~main____CPAchecker_TMP_4~0#1; [2025-03-09 01:56:36,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L56: havoc main_~main____CPAchecker_TMP_2~0#1;havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1; [2025-03-09 01:56:36,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L147: havoc main_~__tmp_8~0#1, main_~__VERIFIER_assert__cond~7#1;havoc main_~__tmp_7~0#1, main_~__VERIFIER_assert__cond~6#1; [2025-03-09 01:56:36,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L98: havoc main_~main____CPAchecker_TMP_3~0#1; [2025-03-09 01:56:36,680 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L321: havoc main_~main____CPAchecker_TMP_0~1#1; [2025-03-09 01:56:36,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L371: havoc main_~__tmp_20~0#1, main_~__VERIFIER_assert__cond~19#1;havoc main_~__tmp_19~0#1, main_~__VERIFIER_assert__cond~18#1; [2025-03-09 01:56:36,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L338: havoc main_~__tmp_18~0#1, main_~__VERIFIER_assert__cond~17#1;havoc main_~__tmp_17~0#1, main_~__VERIFIER_assert__cond~16#1; [2025-03-09 01:56:36,681 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L282: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~__tmp_14~0#1, main_~__VERIFIER_assert__cond~13#1;havoc main_~__tmp_13~0#1, main_~__VERIFIER_assert__cond~12#1; [2025-03-09 01:56:36,701 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2025-03-09 01:56:36,701 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:56:36,712 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:56:36,712 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:56:36,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:56:36 BoogieIcfgContainer [2025-03-09 01:56:36,713 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:56:36,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:56:36,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:56:36,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:56:36,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:56:36" (1/3) ... [2025-03-09 01:56:36,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f593e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:56:36, skipping insertion in model container [2025-03-09 01:56:36,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:56:36" (2/3) ... [2025-03-09 01:56:36,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f593e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:56:36, skipping insertion in model container [2025-03-09 01:56:36,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:56:36" (3/3) ... [2025-03-09 01:56:36,720 INFO L128 eAbstractionObserver]: Analyzing ICFG apache-get-tag.i.v+lhb-reducer.c [2025-03-09 01:56:36,731 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:56:36,732 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG apache-get-tag.i.v+lhb-reducer.c that has 2 procedures, 98 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-09 01:56:36,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:56:36,774 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@128a55ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:56:36,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-09 01:56:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 68 states have (on average 1.588235294117647) internal successors, (108), 78 states have internal predecessors, (108), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 01:56:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 01:56:36,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:36,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 01:56:36,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:56:36,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:36,783 INFO L85 PathProgramCache]: Analyzing trace with hash 7079231, now seen corresponding path program 1 times [2025-03-09 01:56:36,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:36,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218499802] [2025-03-09 01:56:36,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:36,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:36,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 01:56:36,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 01:56:36,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:36,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:36,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:36,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218499802] [2025-03-09 01:56:36,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218499802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:36,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:36,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:56:36,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865277445] [2025-03-09 01:56:36,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:36,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:56:36,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:36,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:56:36,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:36,927 INFO L87 Difference]: Start difference. First operand has 98 states, 68 states have (on average 1.588235294117647) internal successors, (108), 78 states have internal predecessors, (108), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:36,991 INFO L93 Difference]: Finished difference Result 101 states and 146 transitions. [2025-03-09 01:56:36,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:56:36,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-09 01:56:36,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:36,996 INFO L225 Difference]: With dead ends: 101 [2025-03-09 01:56:36,996 INFO L226 Difference]: Without dead ends: 46 [2025-03-09 01:56:36,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:37,001 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:37,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 182 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:56:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-09 01:56:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-09 01:56:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2025-03-09 01:56:37,027 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 4 [2025-03-09 01:56:37,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:37,027 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2025-03-09 01:56:37,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2025-03-09 01:56:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 01:56:37,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:37,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 01:56:37,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:56:37,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:56:37,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:37,030 INFO L85 PathProgramCache]: Analyzing trace with hash 219456323, now seen corresponding path program 1 times [2025-03-09 01:56:37,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:37,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272430723] [2025-03-09 01:56:37,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:37,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:37,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 01:56:37,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 01:56:37,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:37,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:37,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:37,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272430723] [2025-03-09 01:56:37,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272430723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:37,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:37,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:56:37,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848891511] [2025-03-09 01:56:37,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:37,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:56:37,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:37,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:56:37,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:37,075 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:37,095 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-03-09 01:56:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:56:37,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 01:56:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:37,096 INFO L225 Difference]: With dead ends: 46 [2025-03-09 01:56:37,096 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 01:56:37,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:37,098 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 44 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:37,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 37 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:56:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 01:56:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-09 01:56:37,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 44 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-03-09 01:56:37,104 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 5 [2025-03-09 01:56:37,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:37,104 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-03-09 01:56:37,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,104 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-03-09 01:56:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:56:37,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:37,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:56:37,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:56:37,106 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:56:37,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:37,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1982066075, now seen corresponding path program 1 times [2025-03-09 01:56:37,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:37,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440645013] [2025-03-09 01:56:37,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:37,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:37,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:56:37,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:56:37,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:37,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:37,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440645013] [2025-03-09 01:56:37,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440645013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:37,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:37,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 01:56:37,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223644704] [2025-03-09 01:56:37,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:37,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:56:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:37,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:56:37,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:37,163 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:37,227 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2025-03-09 01:56:37,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:56:37,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-09 01:56:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:37,228 INFO L225 Difference]: With dead ends: 55 [2025-03-09 01:56:37,228 INFO L226 Difference]: Without dead ends: 51 [2025-03-09 01:56:37,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 01:56:37,228 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:37,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:56:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-09 01:56:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-09 01:56:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2025-03-09 01:56:37,232 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 11 [2025-03-09 01:56:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:37,233 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2025-03-09 01:56:37,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2025-03-09 01:56:37,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-09 01:56:37,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:37,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:56:37,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 01:56:37,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:56:37,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:37,234 INFO L85 PathProgramCache]: Analyzing trace with hash 890252959, now seen corresponding path program 1 times [2025-03-09 01:56:37,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:37,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18181397] [2025-03-09 01:56:37,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:37,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:37,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 01:56:37,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 01:56:37,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:37,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:37,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:37,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:37,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18181397] [2025-03-09 01:56:37,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18181397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:37,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:37,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:56:37,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418511059] [2025-03-09 01:56:37,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:37,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:56:37,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:37,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:56:37,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:56:37,334 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:37,422 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2025-03-09 01:56:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:56:37,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-09 01:56:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:37,423 INFO L225 Difference]: With dead ends: 51 [2025-03-09 01:56:37,423 INFO L226 Difference]: Without dead ends: 47 [2025-03-09 01:56:37,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:56:37,423 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:37,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 25 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:56:37,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-09 01:56:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-09 01:56:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.186046511627907) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-03-09 01:56:37,431 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 18 [2025-03-09 01:56:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:37,431 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-03-09 01:56:37,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-03-09 01:56:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 01:56:37,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:37,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:56:37,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 01:56:37,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:56:37,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:37,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1828038001, now seen corresponding path program 1 times [2025-03-09 01:56:37,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:37,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577000507] [2025-03-09 01:56:37,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:37,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:37,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 01:56:37,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 01:56:37,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:37,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:37,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:37,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577000507] [2025-03-09 01:56:37,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577000507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:37,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:37,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:56:37,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307899964] [2025-03-09 01:56:37,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:37,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:56:37,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:37,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:56:37,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:56:37,522 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:37,598 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2025-03-09 01:56:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:56:37,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-09 01:56:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:37,600 INFO L225 Difference]: With dead ends: 76 [2025-03-09 01:56:37,601 INFO L226 Difference]: Without dead ends: 72 [2025-03-09 01:56:37,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:56:37,602 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:37,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 31 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:56:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-09 01:56:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-09 01:56:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.161764705882353) internal successors, (79), 71 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2025-03-09 01:56:37,606 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 19 [2025-03-09 01:56:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:37,606 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2025-03-09 01:56:37,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2025-03-09 01:56:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 01:56:37,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:37,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:56:37,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 01:56:37,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:56:37,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:37,607 INFO L85 PathProgramCache]: Analyzing trace with hash 836121067, now seen corresponding path program 1 times [2025-03-09 01:56:37,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:37,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930166877] [2025-03-09 01:56:37,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:37,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:37,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:56:37,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:56:37,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:37,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:37,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:37,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930166877] [2025-03-09 01:56:37,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930166877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:56:37,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:56:37,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 01:56:37,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348735086] [2025-03-09 01:56:37,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:56:37,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:56:37,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:37,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:56:37,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:56:37,698 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:37,794 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2025-03-09 01:56:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:56:37,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-09 01:56:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:37,795 INFO L225 Difference]: With dead ends: 102 [2025-03-09 01:56:37,795 INFO L226 Difference]: Without dead ends: 98 [2025-03-09 01:56:37,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-09 01:56:37,796 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:37,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 36 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:56:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-09 01:56:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-09 01:56:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.148936170212766) internal successors, (108), 97 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2025-03-09 01:56:37,805 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 25 [2025-03-09 01:56:37,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:37,805 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2025-03-09 01:56:37,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2025-03-09 01:56:37,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 01:56:37,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:37,806 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:56:37,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 01:56:37,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:56:37,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:37,806 INFO L85 PathProgramCache]: Analyzing trace with hash 980527455, now seen corresponding path program 1 times [2025-03-09 01:56:37,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:37,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574841652] [2025-03-09 01:56:37,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:37,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:37,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:56:37,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:56:37,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:37,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:37,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:37,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574841652] [2025-03-09 01:56:37,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574841652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:56:37,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362666514] [2025-03-09 01:56:37,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:37,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:37,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:37,914 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:56:37,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 01:56:37,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 01:56:37,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 01:56:37,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:37,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:37,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:56:37,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:38,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:56:38,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:38,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362666514] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:56:38,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:56:38,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-09 01:56:38,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683442541] [2025-03-09 01:56:38,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:56:38,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 01:56:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:38,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 01:56:38,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:56:38,126 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:38,358 INFO L93 Difference]: Finished difference Result 232 states and 273 transitions. [2025-03-09 01:56:38,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:56:38,359 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-09 01:56:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:38,360 INFO L225 Difference]: With dead ends: 232 [2025-03-09 01:56:38,360 INFO L226 Difference]: Without dead ends: 228 [2025-03-09 01:56:38,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-09 01:56:38,360 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 220 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:38,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 68 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 01:56:38,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-09 01:56:38,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-03-09 01:56:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 224 states have (on average 1.1294642857142858) internal successors, (253), 227 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 253 transitions. [2025-03-09 01:56:38,372 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 253 transitions. Word has length 32 [2025-03-09 01:56:38,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:38,372 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 253 transitions. [2025-03-09 01:56:38,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 253 transitions. [2025-03-09 01:56:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 01:56:38,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:38,377 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:56:38,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:56:38,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:38,578 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:56:38,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:38,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1565278361, now seen corresponding path program 1 times [2025-03-09 01:56:38,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:38,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014205991] [2025-03-09 01:56:38,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:38,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:38,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 01:56:38,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 01:56:38,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:38,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:38,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:38,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014205991] [2025-03-09 01:56:38,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014205991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:56:38,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589382312] [2025-03-09 01:56:38,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:38,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:38,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:38,784 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:56:38,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 01:56:38,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 01:56:38,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 01:56:38,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:38,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:38,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 01:56:38,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:38,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:56:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:39,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589382312] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:56:39,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:56:39,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2025-03-09 01:56:39,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995320585] [2025-03-09 01:56:39,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:56:39,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 01:56:39,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:39,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 01:56:39,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:56:39,126 INFO L87 Difference]: Start difference. First operand 228 states and 253 transitions. Second operand has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:39,578 INFO L93 Difference]: Finished difference Result 492 states and 583 transitions. [2025-03-09 01:56:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-09 01:56:39,578 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-03-09 01:56:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:39,581 INFO L225 Difference]: With dead ends: 492 [2025-03-09 01:56:39,582 INFO L226 Difference]: Without dead ends: 488 [2025-03-09 01:56:39,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2025-03-09 01:56:39,582 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 735 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:39,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 130 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:56:39,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-09 01:56:39,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-03-09 01:56:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 484 states have (on average 1.121900826446281) internal successors, (543), 487 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:39,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 543 transitions. [2025-03-09 01:56:39,603 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 543 transitions. Word has length 64 [2025-03-09 01:56:39,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:39,603 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 543 transitions. [2025-03-09 01:56:39,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.8) internal successors, (136), 21 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:39,603 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 543 transitions. [2025-03-09 01:56:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-09 01:56:39,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:39,609 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:56:39,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 01:56:39,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-09 01:56:39,809 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:56:39,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:39,810 INFO L85 PathProgramCache]: Analyzing trace with hash 990878955, now seen corresponding path program 2 times [2025-03-09 01:56:39,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:39,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717439943] [2025-03-09 01:56:39,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:56:39,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:39,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-03-09 01:56:39,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 129 statements. [2025-03-09 01:56:39,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:56:39,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:39,924 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-09 01:56:39,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:39,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717439943] [2025-03-09 01:56:39,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717439943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:56:39,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214521691] [2025-03-09 01:56:39,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:56:39,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:39,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:39,926 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:56:39,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 01:56:39,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 129 statements into 2 equivalence classes. [2025-03-09 01:56:39,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 129 statements. [2025-03-09 01:56:39,986 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:56:39,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:39,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:56:39,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:40,171 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2025-03-09 01:56:40,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:56:40,335 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2025-03-09 01:56:40,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214521691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:56:40,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:56:40,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 01:56:40,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437174752] [2025-03-09 01:56:40,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:56:40,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:56:40,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:40,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:56:40,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:56:40,337 INFO L87 Difference]: Start difference. First operand 488 states and 543 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:40,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:40,471 INFO L93 Difference]: Finished difference Result 676 states and 765 transitions. [2025-03-09 01:56:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 01:56:40,471 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2025-03-09 01:56:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:40,472 INFO L225 Difference]: With dead ends: 676 [2025-03-09 01:56:40,472 INFO L226 Difference]: Without dead ends: 158 [2025-03-09 01:56:40,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2025-03-09 01:56:40,474 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 98 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:40,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 44 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 01:56:40,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-09 01:56:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-09 01:56:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 155 states have (on average 1.0258064516129033) internal successors, (159), 157 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2025-03-09 01:56:40,477 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 129 [2025-03-09 01:56:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:40,477 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2025-03-09 01:56:40,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2025-03-09 01:56:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-09 01:56:40,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:40,477 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:56:40,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 01:56:40,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:40,682 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:56:40,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:40,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2077696583, now seen corresponding path program 1 times [2025-03-09 01:56:40,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:40,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819771839] [2025-03-09 01:56:40,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:40,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:40,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-09 01:56:40,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-09 01:56:40,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:40,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:41,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 0 proven. 1125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:41,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:41,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819771839] [2025-03-09 01:56:41,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819771839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:56:41,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674635560] [2025-03-09 01:56:41,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:41,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:41,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:41,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:56:41,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 01:56:41,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-09 01:56:41,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-09 01:56:41,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:41,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:41,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 01:56:41,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 0 proven. 1125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:41,428 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:56:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1125 backedges. 0 proven. 1125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:41,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674635560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:56:41,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:56:41,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2025-03-09 01:56:41,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559448059] [2025-03-09 01:56:41,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:56:41,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-09 01:56:41,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:41,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-09 01:56:41,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2025-03-09 01:56:41,998 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand has 41 states, 40 states have (on average 7.1) internal successors, (284), 41 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:42,500 INFO L93 Difference]: Finished difference Result 541 states and 599 transitions. [2025-03-09 01:56:42,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-09 01:56:42,501 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 7.1) internal successors, (284), 41 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-03-09 01:56:42,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:42,502 INFO L225 Difference]: With dead ends: 541 [2025-03-09 01:56:42,502 INFO L226 Difference]: Without dead ends: 298 [2025-03-09 01:56:42,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2025-03-09 01:56:42,503 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 563 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:42,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 101 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 01:56:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-03-09 01:56:42,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-03-09 01:56:42,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 295 states have (on average 1.0135593220338983) internal successors, (299), 297 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:42,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 299 transitions. [2025-03-09 01:56:42,509 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 299 transitions. Word has length 138 [2025-03-09 01:56:42,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:42,510 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 299 transitions. [2025-03-09 01:56:42,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 7.1) internal successors, (284), 41 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 299 transitions. [2025-03-09 01:56:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-09 01:56:42,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:42,512 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:56:42,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 01:56:42,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:42,712 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:56:42,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1218708601, now seen corresponding path program 2 times [2025-03-09 01:56:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301571870] [2025-03-09 01:56:42,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:56:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:42,741 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 278 statements into 2 equivalence classes. [2025-03-09 01:56:42,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 278 of 278 statements. [2025-03-09 01:56:42,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:56:42,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:44,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5035 backedges. 0 proven. 5035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:44,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:44,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301571870] [2025-03-09 01:56:44,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301571870] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:56:44,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169928282] [2025-03-09 01:56:44,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:56:44,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:44,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:44,172 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:56:44,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 01:56:44,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 278 statements into 2 equivalence classes. [2025-03-09 01:56:44,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 278 of 278 statements. [2025-03-09 01:56:44,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:56:44,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:44,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-09 01:56:44,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5035 backedges. 0 proven. 5035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:44,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:56:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5035 backedges. 0 proven. 5035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:46,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169928282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:56:46,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:56:46,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 80 [2025-03-09 01:56:46,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295077127] [2025-03-09 01:56:46,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:56:46,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2025-03-09 01:56:46,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:46,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2025-03-09 01:56:46,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2025-03-09 01:56:46,262 INFO L87 Difference]: Start difference. First operand 298 states and 299 transitions. Second operand has 81 states, 80 states have (on average 7.05) internal successors, (564), 81 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:47,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:47,230 INFO L93 Difference]: Finished difference Result 1061 states and 1179 transitions. [2025-03-09 01:56:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-09 01:56:47,231 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 80 states have (on average 7.05) internal successors, (564), 81 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 278 [2025-03-09 01:56:47,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:47,233 INFO L225 Difference]: With dead ends: 1061 [2025-03-09 01:56:47,233 INFO L226 Difference]: Without dead ends: 578 [2025-03-09 01:56:47,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 594 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2025-03-09 01:56:47,234 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1163 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:47,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 189 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 01:56:47,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-09 01:56:47,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2025-03-09 01:56:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 575 states have (on average 1.0069565217391305) internal successors, (579), 577 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 579 transitions. [2025-03-09 01:56:47,241 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 579 transitions. Word has length 278 [2025-03-09 01:56:47,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:47,242 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 579 transitions. [2025-03-09 01:56:47,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 80 states have (on average 7.05) internal successors, (564), 81 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 579 transitions. [2025-03-09 01:56:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2025-03-09 01:56:47,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:47,247 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 78, 78, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:56:47,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 01:56:47,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 01:56:47,451 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:56:47,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:47,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1552289287, now seen corresponding path program 3 times [2025-03-09 01:56:47,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:47,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747005171] [2025-03-09 01:56:47,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:56:47,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:47,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 558 statements into 79 equivalence classes. [2025-03-09 01:56:47,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 558 statements. [2025-03-09 01:56:47,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:56:47,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 21255 backedges. 0 proven. 542 refuted. 0 times theorem prover too weak. 20713 trivial. 0 not checked. [2025-03-09 01:56:47,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747005171] [2025-03-09 01:56:47,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747005171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:56:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12838903] [2025-03-09 01:56:47,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:56:47,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:47,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:47,576 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:56:47,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 01:56:47,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 558 statements into 79 equivalence classes. [2025-03-09 01:56:47,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 558 statements. [2025-03-09 01:56:47,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 01:56:47,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:47,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:56:47,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 21255 backedges. 154 proven. 311 refuted. 0 times theorem prover too weak. 20790 trivial. 0 not checked. [2025-03-09 01:56:48,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:56:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 21255 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 20790 trivial. 0 not checked. [2025-03-09 01:56:48,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12838903] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:56:48,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:56:48,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-09 01:56:48,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10215467] [2025-03-09 01:56:48,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:56:48,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:56:48,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:48,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:56:48,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:56:48,638 INFO L87 Difference]: Start difference. First operand 578 states and 579 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:48,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:48,711 INFO L93 Difference]: Finished difference Result 578 states and 579 transitions. [2025-03-09 01:56:48,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 01:56:48,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 558 [2025-03-09 01:56:48,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:48,713 INFO L225 Difference]: With dead ends: 578 [2025-03-09 01:56:48,713 INFO L226 Difference]: Without dead ends: 576 [2025-03-09 01:56:48,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1126 GetRequests, 1109 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2025-03-09 01:56:48,714 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 50 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:56:48,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 15 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:56:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-09 01:56:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 559. [2025-03-09 01:56:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.0017921146953406) internal successors, (559), 558 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 559 transitions. [2025-03-09 01:56:48,721 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 559 transitions. Word has length 558 [2025-03-09 01:56:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:48,721 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 559 transitions. [2025-03-09 01:56:48,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:56:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 559 transitions. [2025-03-09 01:56:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2025-03-09 01:56:48,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:48,727 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 77, 77, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:56:48,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 01:56:48,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:48,928 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:56:48,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:48,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1162639227, now seen corresponding path program 1 times [2025-03-09 01:56:48,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:48,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807438102] [2025-03-09 01:56:48,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:48,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:48,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 558 statements into 1 equivalence classes. [2025-03-09 01:56:49,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 558 of 558 statements. [2025-03-09 01:56:49,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:49,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:53,254 INFO L134 CoverageAnalysis]: Checked inductivity of 20330 backedges. 0 proven. 20330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:53,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:53,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807438102] [2025-03-09 01:56:53,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807438102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:56:53,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100326998] [2025-03-09 01:56:53,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:53,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:53,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:53,257 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:56:53,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 01:56:53,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 558 statements into 1 equivalence classes. [2025-03-09 01:56:53,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 558 of 558 statements. [2025-03-09 01:56:53,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:53,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:53,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 2008 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-09 01:56:53,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:54,017 INFO L134 CoverageAnalysis]: Checked inductivity of 20330 backedges. 0 proven. 20330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:54,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:56:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 20330 backedges. 0 proven. 20330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 01:56:58,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100326998] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:56:58,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:56:58,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 160 [2025-03-09 01:56:58,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856766131] [2025-03-09 01:56:58,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:56:58,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 161 states [2025-03-09 01:56:58,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:58,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2025-03-09 01:56:58,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2025-03-09 01:56:58,984 INFO L87 Difference]: Start difference. First operand 559 states and 559 transitions. Second operand has 161 states, 160 states have (on average 7.025) internal successors, (1124), 161 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:02,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:02,574 INFO L93 Difference]: Finished difference Result 2097 states and 2177 transitions. [2025-03-09 01:57:02,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2025-03-09 01:57:02,575 INFO L78 Accepts]: Start accepts. Automaton has has 161 states, 160 states have (on average 7.025) internal successors, (1124), 161 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 558 [2025-03-09 01:57:02,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:02,578 INFO L225 Difference]: With dead ends: 2097 [2025-03-09 01:57:02,578 INFO L226 Difference]: Without dead ends: 1136 [2025-03-09 01:57:02,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1194 GetRequests, 1035 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2025-03-09 01:57:02,584 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3312 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3312 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:02,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3312 Valid, 348 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-09 01:57:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-03-09 01:57:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1119. [2025-03-09 01:57:02,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 1118 states have (on average 1.0008944543828264) internal successors, (1119), 1118 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1119 transitions. [2025-03-09 01:57:02,597 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1119 transitions. Word has length 558 [2025-03-09 01:57:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:02,597 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1119 transitions. [2025-03-09 01:57:02,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 161 states, 160 states have (on average 7.025) internal successors, (1124), 161 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1119 transitions. [2025-03-09 01:57:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1119 [2025-03-09 01:57:02,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:57:02,604 INFO L218 NwaCegarLoop]: trace histogram [157, 157, 157, 157, 156, 156, 156, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:02,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 01:57:02,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:02,805 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-09 01:57:02,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:57:02,806 INFO L85 PathProgramCache]: Analyzing trace with hash -340340101, now seen corresponding path program 2 times [2025-03-09 01:57:02,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:57:02,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922116253] [2025-03-09 01:57:02,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:02,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:57:02,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1118 statements into 2 equivalence classes. [2025-03-09 01:57:02,902 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 1118 statements. [2025-03-09 01:57:02,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:57:02,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 85410 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 85098 trivial. 0 not checked. [2025-03-09 01:57:02,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:57:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922116253] [2025-03-09 01:57:02,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922116253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:57:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945486031] [2025-03-09 01:57:02,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:57:02,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:57:02,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:57:02,985 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 01:57:02,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 01:57:03,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1118 statements into 2 equivalence classes. [2025-03-09 01:57:03,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 1118 statements. [2025-03-09 01:57:03,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:57:03,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:57:03,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:57:03,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:57:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 85410 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85410 trivial. 0 not checked. [2025-03-09 01:57:04,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:57:04,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945486031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:57:04,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:57:04,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2025-03-09 01:57:04,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330635135] [2025-03-09 01:57:04,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:57:04,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:57:04,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:57:04,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:57:04,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:57:04,015 INFO L87 Difference]: Start difference. First operand 1119 states and 1119 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:57:04,060 INFO L93 Difference]: Finished difference Result 1119 states and 1119 transitions. [2025-03-09 01:57:04,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:57:04,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1118 [2025-03-09 01:57:04,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:57:04,061 INFO L225 Difference]: With dead ends: 1119 [2025-03-09 01:57:04,061 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 01:57:04,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1129 GetRequests, 1115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-03-09 01:57:04,062 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 32 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 01:57:04,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 16 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 01:57:04,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 01:57:04,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 01:57:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 01:57:04,063 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1118 [2025-03-09 01:57:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:57:04,063 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 01:57:04,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 01:57:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 01:57:04,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 01:57:04,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2025-03-09 01:57:04,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-09 01:57:04,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-09 01:57:04,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-09 01:57:04,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-09 01:57:04,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-09 01:57:04,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-09 01:57:04,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-09 01:57:04,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-09 01:57:04,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2025-03-09 01:57:04,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:57:04,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 01:57:04,274 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:57:04,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 01:57:04,294 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 01:57:04,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 01:57:04 BoogieIcfgContainer [2025-03-09 01:57:04,299 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 01:57:04,299 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 01:57:04,299 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 01:57:04,299 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 01:57:04,300 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:56:36" (3/4) ... [2025-03-09 01:57:04,301 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 01:57:04,305 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reach_error [2025-03-09 01:57:04,309 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-09 01:57:04,309 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 01:57:04,310 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 01:57:04,310 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 01:57:04,371 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 01:57:04,371 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 01:57:04,371 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 01:57:04,372 INFO L158 Benchmark]: Toolchain (without parser) took 28354.08ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 104.8MB in the beginning and 411.8MB in the end (delta: -307.0MB). Peak memory consumption was 281.5MB. Max. memory is 16.1GB. [2025-03-09 01:57:04,372 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:04,372 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.11ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 91.5MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 01:57:04,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.67ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:04,373 INFO L158 Benchmark]: Boogie Preprocessor took 45.59ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 88.5MB in the end (delta: 987.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 01:57:04,373 INFO L158 Benchmark]: IcfgBuilder took 393.04ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 67.4MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 01:57:04,373 INFO L158 Benchmark]: TraceAbstraction took 27584.09ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 67.4MB in the beginning and 420.1MB in the end (delta: -352.7MB). Peak memory consumption was 231.2MB. Max. memory is 16.1GB. [2025-03-09 01:57:04,373 INFO L158 Benchmark]: Witness Printer took 72.39ms. Allocated memory is still 729.8MB. Free memory was 420.1MB in the beginning and 411.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 01:57:04,378 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.11ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 91.5MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.67ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 89.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.59ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 88.5MB in the end (delta: 987.1kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 393.04ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 67.4MB in the end (delta: 21.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 27584.09ms. Allocated memory was 142.6MB in the beginning and 729.8MB in the end (delta: 587.2MB). Free memory was 67.4MB in the beginning and 420.1MB in the end (delta: -352.7MB). Peak memory consumption was 231.2MB. Max. memory is 16.1GB. * Witness Printer took 72.39ms. Allocated memory is still 729.8MB. Free memory was 420.1MB in the beginning and 411.8MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 194]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 61]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 287]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 287]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 162 edges, 10 error locations. Started 1 CEGAR loops. OverallTime: 27.5s, OverallIterations: 14, TraceHistogramMax: 157, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6339 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6339 mSDsluCounter, 1267 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 954 mSDsCounter, 798 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4638 IncrementalHoareTripleChecker+Invalid, 5436 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 798 mSolverCounterUnsat, 313 mSDtfsCounter, 4638 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4825 GetRequests, 4461 SyntacticMatches, 2 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1119occurred in iteration=13, InterpolantAutomatonStates: 364, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 34 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 5832 NumberOfCodeBlocks, 2362 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 7560 ConstructedInterpolants, 0 QuantifiedInterpolants, 22759 SizeOfPredicates, 5 NumberOfNonLiveVariables, 4167 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 29 InterpolantComputations, 7 PerfectInterpolantSequences, 234247/315714 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 01:57:04,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE