./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:51:11,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:51:11,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:51:11,681 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:51:11,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:51:11,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:51:11,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:51:11,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:51:11,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:51:11,707 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:51:11,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:51:11,707 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:51:11,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:51:11,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:51:11,708 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:51:11,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:51:11,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:51:11,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:51:11,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:51:11,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:51:11,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:51:11,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:51:11,709 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:51:11,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:51:11,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:51:11,709 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:51:11,709 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:51:11,710 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:51:11,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:51:11,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:51:11,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:51:11,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:51:11,710 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:51:11,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:51:11,710 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:51:11,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:51:11,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:51:11,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:51:11,711 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:51:11,711 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:51:11,711 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:51:11,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:51:11,711 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2025-03-09 05:51:11,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:51:11,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:51:11,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:51:11,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:51:11,951 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:51:11,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-03-09 05:51:13,168 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66377c2b/1a17ae57b0514d72991577e5d271b3cd/FLAGc91ab707d [2025-03-09 05:51:13,548 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:51:13,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-03-09 05:51:13,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66377c2b/1a17ae57b0514d72991577e5d271b3cd/FLAGc91ab707d [2025-03-09 05:51:13,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d66377c2b/1a17ae57b0514d72991577e5d271b3cd [2025-03-09 05:51:13,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:51:13,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:51:13,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:51:13,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:51:13,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:51:13,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:51:13" (1/1) ... [2025-03-09 05:51:13,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fadc93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:13, skipping insertion in model container [2025-03-09 05:51:13,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:51:13" (1/1) ... [2025-03-09 05:51:13,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:51:14,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:51:14,282 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:51:14,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:51:14,428 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:51:14,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:14 WrapperNode [2025-03-09 05:51:14,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:51:14,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:51:14,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:51:14,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:51:14,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:14" (1/1) ... [2025-03-09 05:51:14,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:14" (1/1) ... [2025-03-09 05:51:14,494 INFO L138 Inliner]: procedures = 346, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 725 [2025-03-09 05:51:14,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:51:14,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:51:14,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:51:14,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:51:14,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:14" (1/1) ... [2025-03-09 05:51:14,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:14" (1/1) ... [2025-03-09 05:51:14,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:14" (1/1) ... [2025-03-09 05:51:14,536 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 3, 355, 12, 2, 12, 2]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 1, 355, 0, 0, 0, 0]. The 11 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 5, 2, 2, 1]. [2025-03-09 05:51:14,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:14" (1/1) ... [2025-03-09 05:51:14,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:14" (1/1) ... [2025-03-09 05:51:14,566 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:14" (1/1) ... [2025-03-09 05:51:14,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:14" (1/1) ... [2025-03-09 05:51:14,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:14" (1/1) ... [2025-03-09 05:51:14,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:14" (1/1) ... [2025-03-09 05:51:14,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:51:14,581 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:51:14,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:51:14,581 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:51:14,582 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:14" (1/1) ... [2025-03-09 05:51:14,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:51:14,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:14,627 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 05:51:14,629 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 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:51:14,644 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-09 05:51:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 05:51:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-09 05:51:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:51:14,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:51:14,911 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:51:14,913 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:51:15,398 INFO L? ?]: Removed 153 outVars from TransFormulas that were not future-live. [2025-03-09 05:51:15,398 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:51:15,408 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:51:15,409 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:51:15,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:51:15 BoogieIcfgContainer [2025-03-09 05:51:15,409 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:51:15,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:51:15,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:51:15,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:51:15,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:51:13" (1/3) ... [2025-03-09 05:51:15,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72805d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:51:15, skipping insertion in model container [2025-03-09 05:51:15,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:14" (2/3) ... [2025-03-09 05:51:15,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72805d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:51:15, skipping insertion in model container [2025-03-09 05:51:15,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:51:15" (3/3) ... [2025-03-09 05:51:15,417 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-2.i [2025-03-09 05:51:15,457 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:51:15,459 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-2.i that has 2 procedures, 117 locations, 1 initial locations, 7 loop locations, and 24 error locations. [2025-03-09 05:51:15,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:51:15,515 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;@61504e64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:51:15,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-09 05:51:15,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 89 states have (on average 1.696629213483146) internal successors, (151), 113 states have internal predecessors, (151), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:15,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:51:15,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:15,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:51:15,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:15,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:15,539 INFO L85 PathProgramCache]: Analyzing trace with hash 6309695, now seen corresponding path program 1 times [2025-03-09 05:51:15,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:15,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309502944] [2025-03-09 05:51:15,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:15,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:15,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:51:15,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:51:15,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:15,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:15,986 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 05:51:15,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:15,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309502944] [2025-03-09 05:51:15,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309502944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:15,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:15,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:51:15,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950939738] [2025-03-09 05:51:15,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:15,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:15,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:16,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:16,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:51:16,011 INFO L87 Difference]: Start difference. First operand has 117 states, 89 states have (on average 1.696629213483146) internal successors, (151), 113 states have internal predecessors, (151), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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 05:51:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:16,091 INFO L93 Difference]: Finished difference Result 230 states and 308 transitions. [2025-03-09 05:51:16,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:16,093 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 05:51:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:16,099 INFO L225 Difference]: With dead ends: 230 [2025-03-09 05:51:16,099 INFO L226 Difference]: Without dead ends: 114 [2025-03-09 05:51:16,102 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 05:51:16,106 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:16,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 281 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-09 05:51:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-09 05:51:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.6206896551724137) internal successors, (141), 110 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 145 transitions. [2025-03-09 05:51:16,145 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 145 transitions. Word has length 4 [2025-03-09 05:51:16,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:16,145 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 145 transitions. [2025-03-09 05:51:16,145 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 05:51:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 145 transitions. [2025-03-09 05:51:16,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:51:16,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:16,146 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:51:16,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:51:16,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:16,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:16,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1006299126, now seen corresponding path program 1 times [2025-03-09 05:51:16,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:16,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624672598] [2025-03-09 05:51:16,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:16,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:16,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:51:16,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:51:16,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:16,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:16,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:51:16,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624672598] [2025-03-09 05:51:16,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624672598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:16,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375915874] [2025-03-09 05:51:16,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:16,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:16,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:16,330 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 05:51:16,332 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 05:51:16,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:51:16,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:51:16,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:16,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:16,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:51:16,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:51:16,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:16,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375915874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:16,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:51:16,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:51:16,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919234582] [2025-03-09 05:51:16,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:16,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:51:16,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:16,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:51:16,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:16,630 INFO L87 Difference]: Start difference. First operand 114 states and 145 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 05:51:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:16,661 INFO L93 Difference]: Finished difference Result 114 states and 145 transitions. [2025-03-09 05:51:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:51:16,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2025-03-09 05:51:16,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:16,662 INFO L225 Difference]: With dead ends: 114 [2025-03-09 05:51:16,662 INFO L226 Difference]: Without dead ends: 113 [2025-03-09 05:51:16,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:16,663 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:16,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 271 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-09 05:51:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-09 05:51:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.6091954022988506) internal successors, (140), 109 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:16,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 144 transitions. [2025-03-09 05:51:16,677 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 144 transitions. Word has length 7 [2025-03-09 05:51:16,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:16,677 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 144 transitions. [2025-03-09 05:51:16,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 05:51:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2025-03-09 05:51:16,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:51:16,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:16,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:51:16,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 05:51:16,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:16,879 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:16,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1130501695, now seen corresponding path program 1 times [2025-03-09 05:51:16,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:16,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954949310] [2025-03-09 05:51:16,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:16,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:51:16,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:51:16,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:16,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:17,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:51:17,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:17,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954949310] [2025-03-09 05:51:17,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954949310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:17,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:17,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:51:17,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809282820] [2025-03-09 05:51:17,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:17,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:17,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:17,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:17,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:51:17,011 INFO L87 Difference]: Start difference. First operand 113 states and 144 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 05:51:17,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:17,029 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2025-03-09 05:51:17,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:17,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2025-03-09 05:51:17,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:17,032 INFO L225 Difference]: With dead ends: 113 [2025-03-09 05:51:17,032 INFO L226 Difference]: Without dead ends: 112 [2025-03-09 05:51:17,032 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 05:51:17,033 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:17,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:17,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-09 05:51:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-03-09 05:51:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.611764705882353) internal successors, (137), 106 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2025-03-09 05:51:17,041 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 8 [2025-03-09 05:51:17,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:17,041 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2025-03-09 05:51:17,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 05:51:17,043 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2025-03-09 05:51:17,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:51:17,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:17,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:17,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:51:17,044 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:17,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash 649056, now seen corresponding path program 1 times [2025-03-09 05:51:17,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:17,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792097462] [2025-03-09 05:51:17,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:17,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:17,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:51:17,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:51:17,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:17,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:51:17,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:17,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792097462] [2025-03-09 05:51:17,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792097462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:17,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204909700] [2025-03-09 05:51:17,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:17,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:17,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:17,206 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 05:51:17,208 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 05:51:17,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:51:17,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:51:17,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:17,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:17,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:51:17,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:51:17,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:17,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204909700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:17,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:51:17,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:51:17,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287839549] [2025-03-09 05:51:17,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:17,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:17,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:17,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:17,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:17,480 INFO L87 Difference]: Start difference. First operand 110 states and 141 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:17,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:17,507 INFO L93 Difference]: Finished difference Result 110 states and 141 transitions. [2025-03-09 05:51:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:17,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-09 05:51:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:17,510 INFO L225 Difference]: With dead ends: 110 [2025-03-09 05:51:17,511 INFO L226 Difference]: Without dead ends: 108 [2025-03-09 05:51:17,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:17,512 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:17,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 138 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:17,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-09 05:51:17,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-09 05:51:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.588235294117647) internal successors, (135), 104 states have internal predecessors, (135), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2025-03-09 05:51:17,522 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 139 transitions. Word has length 12 [2025-03-09 05:51:17,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:17,524 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 139 transitions. [2025-03-09 05:51:17,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 139 transitions. [2025-03-09 05:51:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:51:17,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:17,525 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:17,533 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 05:51:17,725 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,SelfDestructingSolverStorable3 [2025-03-09 05:51:17,726 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:17,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:17,727 INFO L85 PathProgramCache]: Analyzing trace with hash 20120869, now seen corresponding path program 1 times [2025-03-09 05:51:17,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:17,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358411760] [2025-03-09 05:51:17,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:17,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:17,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:51:17,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:51:17,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:17,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:51:17,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:17,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358411760] [2025-03-09 05:51:17,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358411760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:17,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467114220] [2025-03-09 05:51:17,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:17,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:17,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:17,884 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 05:51:17,886 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 05:51:17,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:51:18,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:51:18,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:18,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:18,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:51:18,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:51:18,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:18,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:51:18,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467114220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:51:18,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:51:18,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:51:18,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968017985] [2025-03-09 05:51:18,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:51:18,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:51:18,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:18,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:51:18,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:18,142 INFO L87 Difference]: Start difference. First operand 108 states and 139 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:51:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:18,177 INFO L93 Difference]: Finished difference Result 219 states and 283 transitions. [2025-03-09 05:51:18,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:51:18,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-03-09 05:51:18,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:18,178 INFO L225 Difference]: With dead ends: 219 [2025-03-09 05:51:18,178 INFO L226 Difference]: Without dead ends: 117 [2025-03-09 05:51:18,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:18,179 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 4 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:18,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 401 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-09 05:51:18,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-09 05:51:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.5319148936170213) internal successors, (144), 113 states have internal predecessors, (144), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2025-03-09 05:51:18,190 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 13 [2025-03-09 05:51:18,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:18,190 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2025-03-09 05:51:18,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:51:18,190 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2025-03-09 05:51:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:51:18,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:18,190 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:18,200 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 05:51:18,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:18,395 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:18,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:18,395 INFO L85 PathProgramCache]: Analyzing trace with hash -539754278, now seen corresponding path program 2 times [2025-03-09 05:51:18,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:18,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601435849] [2025-03-09 05:51:18,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:51:18,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:18,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:51:18,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-09 05:51:18,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:51:18,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:51:18,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:18,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601435849] [2025-03-09 05:51:18,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601435849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:18,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:18,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:51:18,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056014367] [2025-03-09 05:51:18,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:18,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:51:18,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:18,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:51:18,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:18,615 INFO L87 Difference]: Start difference. First operand 117 states and 148 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:18,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:18,658 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2025-03-09 05:51:18,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:51:18,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-09 05:51:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:18,659 INFO L225 Difference]: With dead ends: 117 [2025-03-09 05:51:18,659 INFO L226 Difference]: Without dead ends: 115 [2025-03-09 05:51:18,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:18,660 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 122 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:18,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 379 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:18,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-09 05:51:18,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-09 05:51:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 111 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 146 transitions. [2025-03-09 05:51:18,664 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 146 transitions. Word has length 22 [2025-03-09 05:51:18,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:18,664 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 146 transitions. [2025-03-09 05:51:18,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:18,665 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2025-03-09 05:51:18,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:51:18,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:18,665 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:18,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:51:18,665 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:18,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:18,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1612648966, now seen corresponding path program 1 times [2025-03-09 05:51:18,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:18,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032709172] [2025-03-09 05:51:18,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:18,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:18,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:51:18,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:51:18,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:18,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:51:18,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:18,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032709172] [2025-03-09 05:51:18,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032709172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:18,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:18,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:51:18,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268462722] [2025-03-09 05:51:18,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:18,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:18,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:18,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:18,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:51:18,841 INFO L87 Difference]: Start difference. First operand 115 states and 146 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:18,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:18,861 INFO L93 Difference]: Finished difference Result 213 states and 276 transitions. [2025-03-09 05:51:18,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:18,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-09 05:51:18,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:18,863 INFO L225 Difference]: With dead ends: 213 [2025-03-09 05:51:18,863 INFO L226 Difference]: Without dead ends: 118 [2025-03-09 05:51:18,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 05:51:18,865 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 2 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:18,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 261 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-09 05:51:18,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-09 05:51:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.4948453608247423) internal successors, (145), 114 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2025-03-09 05:51:18,870 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 27 [2025-03-09 05:51:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:18,871 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2025-03-09 05:51:18,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2025-03-09 05:51:18,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:51:18,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:18,871 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:18,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:51:18,871 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:18,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:18,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1401004732, now seen corresponding path program 1 times [2025-03-09 05:51:18,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:18,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144449892] [2025-03-09 05:51:18,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:18,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:18,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:51:18,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:51:18,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:18,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:51:18,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:18,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144449892] [2025-03-09 05:51:18,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144449892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:18,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:18,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:51:18,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807106034] [2025-03-09 05:51:18,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:18,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:18,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:18,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:18,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:51:18,985 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:18,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:18,998 INFO L93 Difference]: Finished difference Result 123 states and 154 transitions. [2025-03-09 05:51:18,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:18,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-09 05:51:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:18,999 INFO L225 Difference]: With dead ends: 123 [2025-03-09 05:51:18,999 INFO L226 Difference]: Without dead ends: 121 [2025-03-09 05:51:18,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 05:51:19,000 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:19,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 262 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:19,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-09 05:51:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-09 05:51:19,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.48) internal successors, (148), 117 states have internal predecessors, (148), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 152 transitions. [2025-03-09 05:51:19,004 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 152 transitions. Word has length 30 [2025-03-09 05:51:19,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:19,004 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 152 transitions. [2025-03-09 05:51:19,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 152 transitions. [2025-03-09 05:51:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:51:19,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:19,005 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:19,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 05:51:19,005 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:19,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:19,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1073938285, now seen corresponding path program 1 times [2025-03-09 05:51:19,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:19,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514723545] [2025-03-09 05:51:19,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:19,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:19,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:51:19,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:51:19,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:19,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 05:51:19,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:19,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514723545] [2025-03-09 05:51:19,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514723545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:19,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:19,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:51:19,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192683005] [2025-03-09 05:51:19,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:19,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:19,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:19,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:51:19,155 INFO L87 Difference]: Start difference. First operand 121 states and 152 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:19,182 INFO L93 Difference]: Finished difference Result 134 states and 167 transitions. [2025-03-09 05:51:19,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:19,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-09 05:51:19,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:19,183 INFO L225 Difference]: With dead ends: 134 [2025-03-09 05:51:19,184 INFO L226 Difference]: Without dead ends: 132 [2025-03-09 05:51:19,185 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 05:51:19,185 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 3 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 258 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 05:51:19,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 258 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:19,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-09 05:51:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2025-03-09 05:51:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 126 states have internal predecessors, (161), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2025-03-09 05:51:19,194 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 30 [2025-03-09 05:51:19,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:19,194 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2025-03-09 05:51:19,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2025-03-09 05:51:19,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 05:51:19,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:19,195 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:19,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 05:51:19,195 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:19,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:19,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1073938125, now seen corresponding path program 1 times [2025-03-09 05:51:19,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:19,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359970029] [2025-03-09 05:51:19,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:19,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:19,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:51:19,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:51:19,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:19,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:51:19,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:19,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359970029] [2025-03-09 05:51:19,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359970029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:19,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301989737] [2025-03-09 05:51:19,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:19,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:19,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:19,334 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 05:51:19,335 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 05:51:19,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 05:51:19,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 05:51:19,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:19,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:19,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:51:19,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:51:19,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 05:51:19,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301989737] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:51:19,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:51:19,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-09 05:51:19,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696852059] [2025-03-09 05:51:19,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:51:19,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 05:51:19,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:19,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 05:51:19,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:51:19,710 INFO L87 Difference]: Start difference. First operand 130 states and 165 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:51:19,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:19,796 INFO L93 Difference]: Finished difference Result 262 states and 338 transitions. [2025-03-09 05:51:19,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 05:51:19,796 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-09 05:51:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:19,798 INFO L225 Difference]: With dead ends: 262 [2025-03-09 05:51:19,798 INFO L226 Difference]: Without dead ends: 147 [2025-03-09 05:51:19,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-09 05:51:19,800 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 5 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:19,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 627 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:51:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-09 05:51:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-09 05:51:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 143 states have internal predecessors, (177), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 181 transitions. [2025-03-09 05:51:19,806 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 181 transitions. Word has length 30 [2025-03-09 05:51:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:19,806 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 181 transitions. [2025-03-09 05:51:19,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:51:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 181 transitions. [2025-03-09 05:51:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:51:19,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:19,807 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:19,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 05:51:20,007 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 05:51:20,008 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:20,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:20,008 INFO L85 PathProgramCache]: Analyzing trace with hash 99149947, now seen corresponding path program 1 times [2025-03-09 05:51:20,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:20,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88875096] [2025-03-09 05:51:20,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:20,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:20,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:51:20,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:51:20,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:20,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:51:20,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:20,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88875096] [2025-03-09 05:51:20,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88875096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:20,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:20,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:51:20,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280198499] [2025-03-09 05:51:20,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:20,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:20,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:20,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:20,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:51:20,213 INFO L87 Difference]: Start difference. First operand 147 states and 181 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:20,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:20,221 INFO L93 Difference]: Finished difference Result 207 states and 261 transitions. [2025-03-09 05:51:20,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:20,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-09 05:51:20,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:20,222 INFO L225 Difference]: With dead ends: 207 [2025-03-09 05:51:20,222 INFO L226 Difference]: Without dead ends: 124 [2025-03-09 05:51:20,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 05:51:20,223 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:20,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:20,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-09 05:51:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-09 05:51:20,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 120 states have internal predecessors, (148), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2025-03-09 05:51:20,227 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 49 [2025-03-09 05:51:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:20,228 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2025-03-09 05:51:20,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2025-03-09 05:51:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:51:20,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:20,229 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:20,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:51:20,229 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:20,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:20,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1626790216, now seen corresponding path program 1 times [2025-03-09 05:51:20,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:20,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256261964] [2025-03-09 05:51:20,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:20,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:20,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:51:20,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:51:20,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:20,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-09 05:51:20,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:20,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256261964] [2025-03-09 05:51:20,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256261964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:20,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:20,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:51:20,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601107100] [2025-03-09 05:51:20,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:20,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:20,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:20,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:20,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:51:20,355 INFO L87 Difference]: Start difference. First operand 124 states and 152 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:20,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:20,371 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2025-03-09 05:51:20,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:20,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-09 05:51:20,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:20,373 INFO L225 Difference]: With dead ends: 124 [2025-03-09 05:51:20,374 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 05:51:20,374 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 05:51:20,374 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:20,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 05:51:20,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2025-03-09 05:51:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.3148148148148149) internal successors, (142), 115 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2025-03-09 05:51:20,380 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 49 [2025-03-09 05:51:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:20,380 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2025-03-09 05:51:20,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2025-03-09 05:51:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-09 05:51:20,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:20,382 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:20,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 05:51:20,382 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:20,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:20,382 INFO L85 PathProgramCache]: Analyzing trace with hash 793820825, now seen corresponding path program 1 times [2025-03-09 05:51:20,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:20,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242558942] [2025-03-09 05:51:20,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:20,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:20,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 05:51:20,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 05:51:20,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:20,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:51:20,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:20,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242558942] [2025-03-09 05:51:20,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242558942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:20,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:20,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:51:20,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857466134] [2025-03-09 05:51:20,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:20,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:51:20,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:20,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:51:20,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:51:20,750 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:20,821 INFO L93 Difference]: Finished difference Result 184 states and 232 transitions. [2025-03-09 05:51:20,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:51:20,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-03-09 05:51:20,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:20,823 INFO L225 Difference]: With dead ends: 184 [2025-03-09 05:51:20,823 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 05:51:20,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:51:20,824 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 101 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:20,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 357 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:51:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 05:51:20,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-09 05:51:20,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 115 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2025-03-09 05:51:20,831 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 51 [2025-03-09 05:51:20,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:20,832 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2025-03-09 05:51:20,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:20,832 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2025-03-09 05:51:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 05:51:20,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:20,834 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:20,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 05:51:20,835 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:20,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:20,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1171928958, now seen corresponding path program 1 times [2025-03-09 05:51:20,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:20,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547683230] [2025-03-09 05:51:20,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:20,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:20,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:51:20,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:51:20,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:20,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:51:21,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:21,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547683230] [2025-03-09 05:51:21,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547683230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:21,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870862806] [2025-03-09 05:51:21,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:21,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:21,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:21,016 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 05:51:21,018 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 05:51:21,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 05:51:21,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 05:51:21,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:21,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:21,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:51:21,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:51:21,334 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:21,351 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-09 05:51:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870862806] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:51:21,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:51:21,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:51:21,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769623725] [2025-03-09 05:51:21,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:51:21,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:51:21,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:21,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:51:21,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:21,353 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:21,377 INFO L93 Difference]: Finished difference Result 213 states and 268 transitions. [2025-03-09 05:51:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:51:21,377 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-03-09 05:51:21,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:21,378 INFO L225 Difference]: With dead ends: 213 [2025-03-09 05:51:21,378 INFO L226 Difference]: Without dead ends: 137 [2025-03-09 05:51:21,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:21,379 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 4 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:21,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 300 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:21,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-09 05:51:21,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-09 05:51:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 126 states have (on average 1.2619047619047619) internal successors, (159), 133 states have internal predecessors, (159), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 163 transitions. [2025-03-09 05:51:21,384 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 163 transitions. Word has length 55 [2025-03-09 05:51:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:21,384 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 163 transitions. [2025-03-09 05:51:21,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 163 transitions. [2025-03-09 05:51:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-09 05:51:21,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:21,385 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 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 05:51:21,393 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 05:51:21,589 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,SelfDestructingSolverStorable13 [2025-03-09 05:51:21,589 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:21,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:21,589 INFO L85 PathProgramCache]: Analyzing trace with hash -342658335, now seen corresponding path program 1 times [2025-03-09 05:51:21,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:21,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116972447] [2025-03-09 05:51:21,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:21,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:21,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 05:51:21,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 05:51:21,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:21,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:51:21,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:21,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116972447] [2025-03-09 05:51:21,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116972447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:21,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415233185] [2025-03-09 05:51:21,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:21,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:21,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:21,803 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 05:51:21,805 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 05:51:21,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 05:51:22,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 05:51:22,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:22,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:22,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 1296 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:51:22,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:51:22,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:51:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415233185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:51:22,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:51:22,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 05:51:22,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092078210] [2025-03-09 05:51:22,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:51:22,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 05:51:22,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:22,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 05:51:22,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:51:22,177 INFO L87 Difference]: Start difference. First operand 137 states and 163 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:22,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:22,232 INFO L93 Difference]: Finished difference Result 258 states and 319 transitions. [2025-03-09 05:51:22,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 05:51:22,233 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2025-03-09 05:51:22,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:22,234 INFO L225 Difference]: With dead ends: 258 [2025-03-09 05:51:22,234 INFO L226 Difference]: Without dead ends: 173 [2025-03-09 05:51:22,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:51:22,235 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 4 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:22,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 300 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-09 05:51:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-09 05:51:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 162 states have (on average 1.2037037037037037) internal successors, (195), 169 states have internal predecessors, (195), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 199 transitions. [2025-03-09 05:51:22,248 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 199 transitions. Word has length 67 [2025-03-09 05:51:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:22,248 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 199 transitions. [2025-03-09 05:51:22,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 199 transitions. [2025-03-09 05:51:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-09 05:51:22,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:22,249 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 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 05:51:22,260 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 05:51:22,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 05:51:22,450 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:22,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:22,450 INFO L85 PathProgramCache]: Analyzing trace with hash 357672321, now seen corresponding path program 2 times [2025-03-09 05:51:22,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:22,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119006722] [2025-03-09 05:51:22,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:51:22,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:22,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-03-09 05:51:22,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 85 statements. [2025-03-09 05:51:22,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:51:22,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:51:22,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:22,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119006722] [2025-03-09 05:51:22,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119006722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:22,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:22,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 05:51:22,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341649281] [2025-03-09 05:51:22,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:22,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:51:22,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:22,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:51:22,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:51:22,715 INFO L87 Difference]: Start difference. First operand 173 states and 199 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:22,784 INFO L93 Difference]: Finished difference Result 175 states and 202 transitions. [2025-03-09 05:51:22,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:51:22,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2025-03-09 05:51:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:22,785 INFO L225 Difference]: With dead ends: 175 [2025-03-09 05:51:22,785 INFO L226 Difference]: Without dead ends: 174 [2025-03-09 05:51:22,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:22,787 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 87 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:22,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 347 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:51:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-09 05:51:22,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2025-03-09 05:51:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 162 states have (on average 1.1975308641975309) internal successors, (194), 168 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:22,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 198 transitions. [2025-03-09 05:51:22,801 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 198 transitions. Word has length 85 [2025-03-09 05:51:22,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:22,801 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 198 transitions. [2025-03-09 05:51:22,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:22,801 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 198 transitions. [2025-03-09 05:51:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-09 05:51:22,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:22,802 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 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 05:51:22,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 05:51:22,803 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:22,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:22,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1180517899, now seen corresponding path program 1 times [2025-03-09 05:51:22,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:22,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550677204] [2025-03-09 05:51:22,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:22,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:22,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 05:51:22,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 05:51:22,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:22,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:51:22,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:22,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550677204] [2025-03-09 05:51:22,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550677204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:22,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103875688] [2025-03-09 05:51:22,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:22,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:22,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:22,975 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 05:51:22,978 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 05:51:23,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-09 05:51:23,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-09 05:51:23,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:23,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:23,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:51:23,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:51:23,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:23,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103875688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:23,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:51:23,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:51:23,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954560711] [2025-03-09 05:51:23,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:23,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:51:23,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:23,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:51:23,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:23,356 INFO L87 Difference]: Start difference. First operand 172 states and 198 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:23,377 INFO L93 Difference]: Finished difference Result 172 states and 198 transitions. [2025-03-09 05:51:23,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:51:23,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2025-03-09 05:51:23,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:23,379 INFO L225 Difference]: With dead ends: 172 [2025-03-09 05:51:23,379 INFO L226 Difference]: Without dead ends: 171 [2025-03-09 05:51:23,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:23,380 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:23,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 196 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-09 05:51:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-03-09 05:51:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 162 states have (on average 1.191358024691358) internal successors, (193), 167 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 197 transitions. [2025-03-09 05:51:23,395 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 197 transitions. Word has length 85 [2025-03-09 05:51:23,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:23,395 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 197 transitions. [2025-03-09 05:51:23,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 197 transitions. [2025-03-09 05:51:23,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 05:51:23,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:23,397 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 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, 1] [2025-03-09 05:51:23,407 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 05:51:23,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:23,598 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:23,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:23,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1797059870, now seen corresponding path program 1 times [2025-03-09 05:51:23,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:23,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220684222] [2025-03-09 05:51:23,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:23,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:23,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 05:51:23,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 05:51:23,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:23,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-09 05:51:23,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220684222] [2025-03-09 05:51:23,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220684222] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:23,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575137669] [2025-03-09 05:51:23,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:23,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:23,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:23,833 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 05:51:23,835 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 05:51:24,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 05:51:24,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 05:51:24,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:24,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:24,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:51:24,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:51:24,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:24,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575137669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:24,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:51:24,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-09 05:51:24,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960074537] [2025-03-09 05:51:24,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:24,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:51:24,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:24,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:51:24,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:24,303 INFO L87 Difference]: Start difference. First operand 171 states and 197 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:24,340 INFO L93 Difference]: Finished difference Result 171 states and 197 transitions. [2025-03-09 05:51:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:51:24,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2025-03-09 05:51:24,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:24,342 INFO L225 Difference]: With dead ends: 171 [2025-03-09 05:51:24,342 INFO L226 Difference]: Without dead ends: 170 [2025-03-09 05:51:24,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:51:24,343 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 81 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:24,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 185 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-09 05:51:24,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-09 05:51:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 162 states have (on average 1.1851851851851851) internal successors, (192), 166 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 196 transitions. [2025-03-09 05:51:24,355 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 196 transitions. Word has length 86 [2025-03-09 05:51:24,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:24,355 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 196 transitions. [2025-03-09 05:51:24,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 196 transitions. [2025-03-09 05:51:24,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 05:51:24,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:24,356 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 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 05:51:24,365 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 05:51:24,561 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,SelfDestructingSolverStorable17 [2025-03-09 05:51:24,561 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:24,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:24,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2058650818, now seen corresponding path program 1 times [2025-03-09 05:51:24,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:24,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453550423] [2025-03-09 05:51:24,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:24,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:24,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 05:51:24,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 05:51:24,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:24,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:51:24,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:24,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453550423] [2025-03-09 05:51:24,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453550423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:24,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259818288] [2025-03-09 05:51:24,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:24,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:24,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:24,737 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:24,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 05:51:24,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 05:51:25,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 05:51:25,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:25,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:25,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:51:25,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:25,124 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:51:25,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-03-09 05:51:25,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259818288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:51:25,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:51:25,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 05:51:25,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609478991] [2025-03-09 05:51:25,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:51:25,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:51:25,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:25,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:51:25,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:25,155 INFO L87 Difference]: Start difference. First operand 170 states and 196 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:25,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:25,180 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2025-03-09 05:51:25,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:51:25,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2025-03-09 05:51:25,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:25,182 INFO L225 Difference]: With dead ends: 180 [2025-03-09 05:51:25,182 INFO L226 Difference]: Without dead ends: 179 [2025-03-09 05:51:25,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:25,182 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:25,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:25,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-09 05:51:25,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-09 05:51:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 171 states have (on average 1.1754385964912282) internal successors, (201), 175 states have internal predecessors, (201), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:25,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 205 transitions. [2025-03-09 05:51:25,188 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 205 transitions. Word has length 86 [2025-03-09 05:51:25,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:25,189 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 205 transitions. [2025-03-09 05:51:25,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:25,189 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 205 transitions. [2025-03-09 05:51:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-09 05:51:25,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:25,189 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:25,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 05:51:25,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:25,390 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:25,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:25,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1230851181, now seen corresponding path program 2 times [2025-03-09 05:51:25,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:25,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249369218] [2025-03-09 05:51:25,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:51:25,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:25,424 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-09 05:51:25,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 95 statements. [2025-03-09 05:51:25,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:51:25,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-09 05:51:25,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:25,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249369218] [2025-03-09 05:51:25,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249369218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:25,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005660500] [2025-03-09 05:51:25,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:51:25,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:25,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:25,499 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:25,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 05:51:25,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-09 05:51:25,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 95 statements. [2025-03-09 05:51:25,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:51:25,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:25,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:51:25,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-09 05:51:25,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-09 05:51:25,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005660500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:51:25,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:51:25,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 05:51:25,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508404209] [2025-03-09 05:51:25,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:51:25,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:51:25,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:25,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:51:25,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:51:25,933 INFO L87 Difference]: Start difference. First operand 179 states and 205 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:25,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:25,977 INFO L93 Difference]: Finished difference Result 179 states and 205 transitions. [2025-03-09 05:51:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:51:25,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2025-03-09 05:51:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:25,978 INFO L225 Difference]: With dead ends: 179 [2025-03-09 05:51:25,978 INFO L226 Difference]: Without dead ends: 160 [2025-03-09 05:51:25,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:51:25,978 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 141 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:25,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 191 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-09 05:51:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-03-09 05:51:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 153 states have (on average 1.1633986928104576) internal successors, (178), 156 states have internal predecessors, (178), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 182 transitions. [2025-03-09 05:51:25,983 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 182 transitions. Word has length 95 [2025-03-09 05:51:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:25,984 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 182 transitions. [2025-03-09 05:51:25,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2025-03-09 05:51:25,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-09 05:51:25,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:25,984 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:25,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 05:51:26,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:26,189 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:26,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:26,190 INFO L85 PathProgramCache]: Analyzing trace with hash -978766140, now seen corresponding path program 1 times [2025-03-09 05:51:26,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:26,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642534598] [2025-03-09 05:51:26,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:26,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:26,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-09 05:51:26,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-09 05:51:26,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:26,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-09 05:51:26,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:26,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642534598] [2025-03-09 05:51:26,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642534598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:26,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:26,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:51:26,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892729627] [2025-03-09 05:51:26,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:26,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:51:26,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:26,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:51:26,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:51:26,372 INFO L87 Difference]: Start difference. First operand 160 states and 182 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:26,391 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2025-03-09 05:51:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:51:26,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2025-03-09 05:51:26,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:26,392 INFO L225 Difference]: With dead ends: 173 [2025-03-09 05:51:26,392 INFO L226 Difference]: Without dead ends: 172 [2025-03-09 05:51:26,392 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 05:51:26,393 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:26,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 257 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-09 05:51:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2025-03-09 05:51:26,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 163 states have (on average 1.165644171779141) internal successors, (190), 166 states have internal predecessors, (190), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:51:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 196 transitions. [2025-03-09 05:51:26,399 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 196 transitions. Word has length 107 [2025-03-09 05:51:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:26,400 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 196 transitions. [2025-03-09 05:51:26,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2025-03-09 05:51:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 05:51:26,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:26,401 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:26,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 05:51:26,401 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:26,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:26,402 INFO L85 PathProgramCache]: Analyzing trace with hash -276979281, now seen corresponding path program 1 times [2025-03-09 05:51:26,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:26,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619331251] [2025-03-09 05:51:26,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:26,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:26,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 05:51:26,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 05:51:26,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:26,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-09 05:51:26,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:26,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619331251] [2025-03-09 05:51:26,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619331251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:26,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:26,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 05:51:26,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158714171] [2025-03-09 05:51:26,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:26,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:51:26,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:26,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:51:26,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:26,679 INFO L87 Difference]: Start difference. First operand 171 states and 196 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:51:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:26,701 INFO L93 Difference]: Finished difference Result 206 states and 237 transitions. [2025-03-09 05:51:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:51:26,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2025-03-09 05:51:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:26,703 INFO L225 Difference]: With dead ends: 206 [2025-03-09 05:51:26,703 INFO L226 Difference]: Without dead ends: 181 [2025-03-09 05:51:26,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:26,705 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 3 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:26,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 361 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:26,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-09 05:51:26,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2025-03-09 05:51:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 165 states have (on average 1.1636363636363636) internal successors, (192), 168 states have internal predecessors, (192), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:51:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2025-03-09 05:51:26,712 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 108 [2025-03-09 05:51:26,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:26,713 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2025-03-09 05:51:26,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:51:26,713 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2025-03-09 05:51:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 05:51:26,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:26,713 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:26,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 05:51:26,714 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:26,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:26,714 INFO L85 PathProgramCache]: Analyzing trace with hash 610524400, now seen corresponding path program 1 times [2025-03-09 05:51:26,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:26,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878328198] [2025-03-09 05:51:26,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:26,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:26,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 05:51:26,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 05:51:26,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:26,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-09 05:51:26,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:26,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878328198] [2025-03-09 05:51:26,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878328198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 05:51:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49293928] [2025-03-09 05:51:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:26,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 05:51:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:26,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 05:51:26,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:51:26,978 INFO L87 Difference]: Start difference. First operand 173 states and 198 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:27,050 INFO L93 Difference]: Finished difference Result 179 states and 205 transitions. [2025-03-09 05:51:27,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 05:51:27,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2025-03-09 05:51:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:27,051 INFO L225 Difference]: With dead ends: 179 [2025-03-09 05:51:27,051 INFO L226 Difference]: Without dead ends: 178 [2025-03-09 05:51:27,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-09 05:51:27,052 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:27,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 188 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:51:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-09 05:51:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2025-03-09 05:51:27,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 166 states have (on average 1.1626506024096386) internal successors, (193), 169 states have internal predecessors, (193), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:51:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 199 transitions. [2025-03-09 05:51:27,057 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 199 transitions. Word has length 108 [2025-03-09 05:51:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:27,057 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 199 transitions. [2025-03-09 05:51:27,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 199 transitions. [2025-03-09 05:51:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-09 05:51:27,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:27,058 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:27,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 05:51:27,058 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:27,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:27,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1732073710, now seen corresponding path program 2 times [2025-03-09 05:51:27,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:27,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486548224] [2025-03-09 05:51:27,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:51:27,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:27,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-09 05:51:27,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 05:51:27,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:51:27,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 0 proven. 323 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:51:27,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:27,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486548224] [2025-03-09 05:51:27,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486548224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:27,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510779124] [2025-03-09 05:51:27,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:51:27,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:27,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:27,292 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:27,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 05:51:27,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-09 05:51:27,822 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-03-09 05:51:27,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:51:27,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:27,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 1678 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:51:27,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:51:27,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:27,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510779124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:27,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:51:27,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:51:27,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483983477] [2025-03-09 05:51:27,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:27,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:51:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:27,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:51:27,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:27,915 INFO L87 Difference]: Start difference. First operand 174 states and 199 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:27,943 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2025-03-09 05:51:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:51:27,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 109 [2025-03-09 05:51:27,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:27,945 INFO L225 Difference]: With dead ends: 174 [2025-03-09 05:51:27,945 INFO L226 Difference]: Without dead ends: 173 [2025-03-09 05:51:27,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:27,946 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:27,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 169 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-09 05:51:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-09 05:51:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 166 states have (on average 1.1566265060240963) internal successors, (192), 168 states have internal predecessors, (192), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:51:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2025-03-09 05:51:27,954 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 109 [2025-03-09 05:51:27,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:27,955 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2025-03-09 05:51:27,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2025-03-09 05:51:27,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-09 05:51:27,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:27,956 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:27,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 05:51:28,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 05:51:28,158 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:28,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:28,158 INFO L85 PathProgramCache]: Analyzing trace with hash -2140289720, now seen corresponding path program 1 times [2025-03-09 05:51:28,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:28,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526916994] [2025-03-09 05:51:28,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:28,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:28,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:51:28,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:51:28,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:28,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:28,378 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:51:28,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:28,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526916994] [2025-03-09 05:51:28,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526916994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:28,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319430288] [2025-03-09 05:51:28,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:28,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:28,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:28,381 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:28,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 05:51:28,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-09 05:51:28,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-09 05:51:28,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:28,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:28,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:51:28,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:51:28,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-09 05:51:29,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319430288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:51:29,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:51:29,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 05:51:29,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36459897] [2025-03-09 05:51:29,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:51:29,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:51:29,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:29,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:51:29,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:29,027 INFO L87 Difference]: Start difference. First operand 173 states and 198 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:29,083 INFO L93 Difference]: Finished difference Result 276 states and 309 transitions. [2025-03-09 05:51:29,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:51:29,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2025-03-09 05:51:29,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:29,085 INFO L225 Difference]: With dead ends: 276 [2025-03-09 05:51:29,085 INFO L226 Difference]: Without dead ends: 275 [2025-03-09 05:51:29,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:29,085 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:29,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:29,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-09 05:51:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-09 05:51:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 268 states have (on average 1.1194029850746268) internal successors, (300), 270 states have internal predecessors, (300), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:51:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 306 transitions. [2025-03-09 05:51:29,098 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 306 transitions. Word has length 110 [2025-03-09 05:51:29,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:29,098 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 306 transitions. [2025-03-09 05:51:29,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 306 transitions. [2025-03-09 05:51:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-09 05:51:29,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:29,101 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:29,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 05:51:29,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 05:51:29,302 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:29,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:29,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1099636508, now seen corresponding path program 1 times [2025-03-09 05:51:29,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:29,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462166537] [2025-03-09 05:51:29,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:29,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:29,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-09 05:51:29,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 05:51:29,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:29,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2025-03-09 05:51:29,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:29,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462166537] [2025-03-09 05:51:29,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462166537] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:29,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452761432] [2025-03-09 05:51:29,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:29,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:29,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:29,575 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:29,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 05:51:29,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-09 05:51:30,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 05:51:30,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:30,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:30,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 1685 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 05:51:30,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-09 05:51:30,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:30,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452761432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:30,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:51:30,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-09 05:51:30,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969206777] [2025-03-09 05:51:30,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:30,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:51:30,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:30,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:51:30,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:30,100 INFO L87 Difference]: Start difference. First operand 275 states and 306 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:30,114 INFO L93 Difference]: Finished difference Result 275 states and 306 transitions. [2025-03-09 05:51:30,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:51:30,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 123 [2025-03-09 05:51:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:30,116 INFO L225 Difference]: With dead ends: 275 [2025-03-09 05:51:30,116 INFO L226 Difference]: Without dead ends: 274 [2025-03-09 05:51:30,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:30,116 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 2 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:30,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 168 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:30,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-09 05:51:30,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-03-09 05:51:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 268 states have (on average 1.1156716417910448) internal successors, (299), 269 states have internal predecessors, (299), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:51:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 305 transitions. [2025-03-09 05:51:30,126 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 305 transitions. Word has length 123 [2025-03-09 05:51:30,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:30,126 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 305 transitions. [2025-03-09 05:51:30,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:30,127 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 305 transitions. [2025-03-09 05:51:30,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-09 05:51:30,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:30,128 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:30,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-09 05:51:30,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-09 05:51:30,329 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:30,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:30,329 INFO L85 PathProgramCache]: Analyzing trace with hash 271006607, now seen corresponding path program 1 times [2025-03-09 05:51:30,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:30,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991523804] [2025-03-09 05:51:30,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:30,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:30,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-09 05:51:30,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-09 05:51:30,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:30,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-09 05:51:30,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:30,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991523804] [2025-03-09 05:51:30,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991523804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:30,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153743670] [2025-03-09 05:51:30,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:30,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:30,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:30,691 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:30,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 05:51:31,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-09 05:51:31,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-09 05:51:31,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:31,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:31,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 1686 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 05:51:31,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:31,275 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2025-03-09 05:51:31,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-09 05:51:31,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153743670] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:51:31,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:51:31,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-09 05:51:31,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618452260] [2025-03-09 05:51:31,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:51:31,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 05:51:31,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:31,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 05:51:31,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 05:51:31,475 INFO L87 Difference]: Start difference. First operand 274 states and 305 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:51:31,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:31,580 INFO L93 Difference]: Finished difference Result 341 states and 392 transitions. [2025-03-09 05:51:31,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 05:51:31,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 124 [2025-03-09 05:51:31,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:31,582 INFO L225 Difference]: With dead ends: 341 [2025-03-09 05:51:31,583 INFO L226 Difference]: Without dead ends: 274 [2025-03-09 05:51:31,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-09 05:51:31,584 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 35 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:31,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 625 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:51:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-09 05:51:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-03-09 05:51:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 268 states have (on average 1.1119402985074627) internal successors, (298), 269 states have internal predecessors, (298), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:51:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 304 transitions. [2025-03-09 05:51:31,596 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 304 transitions. Word has length 124 [2025-03-09 05:51:31,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:31,597 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 304 transitions. [2025-03-09 05:51:31,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:51:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 304 transitions. [2025-03-09 05:51:31,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-09 05:51:31,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:31,598 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:31,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-09 05:51:31,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:31,798 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:31,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1616566695, now seen corresponding path program 2 times [2025-03-09 05:51:31,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:31,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285231608] [2025-03-09 05:51:31,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:51:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:31,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-03-09 05:51:32,126 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-03-09 05:51:32,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:51:32,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2025-03-09 05:51:33,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:33,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285231608] [2025-03-09 05:51:33,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285231608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:33,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746023840] [2025-03-09 05:51:33,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:51:33,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:33,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:33,121 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:33,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 05:51:33,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-03-09 05:51:33,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-03-09 05:51:33,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:51:33,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:33,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 1970 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 05:51:33,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:33,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 05:51:33,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-03-09 05:51:33,773 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 8 proven. 326 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-09 05:51:33,774 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:33,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-09 05:51:33,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-09 05:51:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2025-03-09 05:51:33,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746023840] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:51:33,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:51:33,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2025-03-09 05:51:33,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842168294] [2025-03-09 05:51:33,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:51:33,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 05:51:33,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:33,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 05:51:33,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-09 05:51:33,873 INFO L87 Difference]: Start difference. First operand 274 states and 304 transitions. Second operand has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:51:33,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:33,958 INFO L93 Difference]: Finished difference Result 329 states and 377 transitions. [2025-03-09 05:51:33,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 05:51:33,959 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 158 [2025-03-09 05:51:33,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:33,960 INFO L225 Difference]: With dead ends: 329 [2025-03-09 05:51:33,960 INFO L226 Difference]: Without dead ends: 274 [2025-03-09 05:51:33,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-09 05:51:33,962 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 16 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:33,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 638 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:51:33,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-09 05:51:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-03-09 05:51:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 268 states have (on average 1.1082089552238805) internal successors, (297), 269 states have internal predecessors, (297), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:51:33,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 303 transitions. [2025-03-09 05:51:33,981 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 303 transitions. Word has length 158 [2025-03-09 05:51:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:33,982 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 303 transitions. [2025-03-09 05:51:33,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.416666666666667) internal successors, (77), 12 states have internal predecessors, (77), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:51:33,982 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 303 transitions. [2025-03-09 05:51:33,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-09 05:51:33,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:33,983 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:33,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 05:51:34,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-09 05:51:34,183 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:34,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1948231109, now seen corresponding path program 1 times [2025-03-09 05:51:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:34,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696898464] [2025-03-09 05:51:34,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:34,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:34,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-09 05:51:34,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-09 05:51:34,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:34,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2025-03-09 05:51:34,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:34,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696898464] [2025-03-09 05:51:34,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696898464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:34,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:34,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 05:51:34,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947902850] [2025-03-09 05:51:34,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:34,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:51:34,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:34,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:51:34,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:34,746 INFO L87 Difference]: Start difference. First operand 274 states and 303 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:34,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:34,784 INFO L93 Difference]: Finished difference Result 330 states and 375 transitions. [2025-03-09 05:51:34,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:51:34,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 165 [2025-03-09 05:51:34,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:34,786 INFO L225 Difference]: With dead ends: 330 [2025-03-09 05:51:34,786 INFO L226 Difference]: Without dead ends: 279 [2025-03-09 05:51:34,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:34,787 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 3 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:34,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 315 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-09 05:51:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2025-03-09 05:51:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 271 states have (on average 1.1070110701107012) internal successors, (300), 272 states have internal predecessors, (300), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:51:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 306 transitions. [2025-03-09 05:51:34,798 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 306 transitions. Word has length 165 [2025-03-09 05:51:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:34,799 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 306 transitions. [2025-03-09 05:51:34,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 306 transitions. [2025-03-09 05:51:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-09 05:51:34,800 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:34,800 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:34,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 05:51:34,800 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:34,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:34,800 INFO L85 PathProgramCache]: Analyzing trace with hash -115026884, now seen corresponding path program 1 times [2025-03-09 05:51:34,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:34,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779796773] [2025-03-09 05:51:34,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:34,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:34,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-09 05:51:35,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-09 05:51:35,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:35,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2025-03-09 05:51:36,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:51:36,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779796773] [2025-03-09 05:51:36,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779796773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:36,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38524822] [2025-03-09 05:51:36,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:36,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:36,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:36,084 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:36,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 05:51:36,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-09 05:51:36,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-09 05:51:36,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:36,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:36,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 1993 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-09 05:51:36,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:36,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 05:51:36,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-09 05:51:36,811 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 8 proven. 326 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-09 05:51:36,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:36,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-03-09 05:51:36,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-09 05:51:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2025-03-09 05:51:36,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38524822] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:51:36,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:51:36,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 16 [2025-03-09 05:51:36,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511979035] [2025-03-09 05:51:36,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:51:36,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 05:51:36,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:51:36,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 05:51:36,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-03-09 05:51:36,957 INFO L87 Difference]: Start difference. First operand 277 states and 306 transitions. Second operand has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:51:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:37,167 INFO L93 Difference]: Finished difference Result 342 states and 392 transitions. [2025-03-09 05:51:37,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 05:51:37,167 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 166 [2025-03-09 05:51:37,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:37,168 INFO L225 Difference]: With dead ends: 342 [2025-03-09 05:51:37,168 INFO L226 Difference]: Without dead ends: 297 [2025-03-09 05:51:37,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-09 05:51:37,169 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 39 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:37,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 919 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:51:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-09 05:51:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 281. [2025-03-09 05:51:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 275 states have (on average 1.1127272727272728) internal successors, (306), 276 states have internal predecessors, (306), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:51:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 312 transitions. [2025-03-09 05:51:37,181 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 312 transitions. Word has length 166 [2025-03-09 05:51:37,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:37,182 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 312 transitions. [2025-03-09 05:51:37,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:51:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 312 transitions. [2025-03-09 05:51:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-09 05:51:37,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:37,183 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:37,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-09 05:51:37,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:37,384 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:37,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:37,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1258314400, now seen corresponding path program 1 times [2025-03-09 05:51:37,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:51:37,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884185001] [2025-03-09 05:51:37,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:37,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:51:37,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-09 05:51:37,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-09 05:51:37,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:37,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 05:51:37,748 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 05:51:37,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-09 05:51:38,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-09 05:51:38,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:38,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 05:51:38,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 05:51:38,207 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 05:51:38,208 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2025-03-09 05:51:38,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2025-03-09 05:51:38,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2025-03-09 05:51:38,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2025-03-09 05:51:38,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2025-03-09 05:51:38,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2025-03-09 05:51:38,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2025-03-09 05:51:38,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2025-03-09 05:51:38,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2025-03-09 05:51:38,210 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2025-03-09 05:51:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2025-03-09 05:51:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2025-03-09 05:51:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2025-03-09 05:51:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2025-03-09 05:51:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2025-03-09 05:51:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2025-03-09 05:51:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2025-03-09 05:51:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2025-03-09 05:51:38,211 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2025-03-09 05:51:38,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2025-03-09 05:51:38,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2025-03-09 05:51:38,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2025-03-09 05:51:38,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2025-03-09 05:51:38,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2025-03-09 05:51:38,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-09 05:51:38,214 INFO L422 BasicCegarLoop]: Path program histogram: [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, 1] [2025-03-09 05:51:38,311 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 05:51:38,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 05:51:38 BoogieIcfgContainer [2025-03-09 05:51:38,313 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 05:51:38,314 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 05:51:38,315 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 05:51:38,315 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 05:51:38,317 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:51:15" (3/4) ... [2025-03-09 05:51:38,319 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 05:51:38,319 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 05:51:38,320 INFO L158 Benchmark]: Toolchain (without parser) took 24578.86ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 104.8MB in the beginning and 92.6MB in the end (delta: 12.3MB). Peak memory consumption was 74.9MB. Max. memory is 16.1GB. [2025-03-09 05:51:38,320 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:51:38,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 686.02ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 58.5MB in the end (delta: 46.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-09 05:51:38,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.19ms. Allocated memory is still 142.6MB. Free memory was 58.5MB in the beginning and 52.1MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:51:38,321 INFO L158 Benchmark]: Boogie Preprocessor took 86.11ms. Allocated memory is still 142.6MB. Free memory was 52.1MB in the beginning and 43.1MB in the end (delta: 9.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 05:51:38,321 INFO L158 Benchmark]: IcfgBuilder took 828.32ms. Allocated memory is still 142.6MB. Free memory was 43.1MB in the beginning and 42.2MB in the end (delta: 840.6kB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2025-03-09 05:51:38,321 INFO L158 Benchmark]: TraceAbstraction took 22902.03ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 41.6MB in the beginning and 94.7MB in the end (delta: -53.1MB). Peak memory consumption was 228.8MB. Max. memory is 16.1GB. [2025-03-09 05:51:38,321 INFO L158 Benchmark]: Witness Printer took 5.76ms. Allocated memory is still 201.3MB. Free memory was 94.7MB in the beginning and 92.6MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:51:38,322 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.24ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 686.02ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 58.5MB in the end (delta: 46.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.19ms. Allocated memory is still 142.6MB. Free memory was 58.5MB in the beginning and 52.1MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 86.11ms. Allocated memory is still 142.6MB. Free memory was 52.1MB in the beginning and 43.1MB in the end (delta: 9.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 828.32ms. Allocated memory is still 142.6MB. Free memory was 43.1MB in the beginning and 42.2MB in the end (delta: 840.6kB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * TraceAbstraction took 22902.03ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 41.6MB in the beginning and 94.7MB in the end (delta: -53.1MB). Peak memory consumption was 228.8MB. Max. memory is 16.1GB. * Witness Printer took 5.76ms. Allocated memory is still 201.3MB. Free memory was 94.7MB in the beginning and 92.6MB in the end (delta: 2.2MB). 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 - UnprovableResult [Line: 1475]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of strcmp at line 1383, overapproximation of strlen at line 1397, overapproximation of strrchr at line 1424. Possible FailurePath: [L1318] static const char *applet_name; [L1319] static signed int bb_errno_location; [L1319] static signed int bb_errno_location; [L1320] static signed int * const bb_errno = &bb_errno_location; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1575] char *a = malloc(11); [L1576] a[10] = 0 [L1577] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=0] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=1] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=2] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=3] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=4] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=5] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=6] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=7] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=8] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=9] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=10] [L1577] COND FALSE !(i<10) [L1579] applet_name = a [L1580] bb_errno_location = __VERIFIER_nondet_int() [L1581] optind = 1 [L1582] int argc = __VERIFIER_nondet_int(); [L1583] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1583] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=2, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1584] EXPR argc+1 [L1584] char **argv=malloc((argc+1)*sizeof(char*)); [L1585] EXPR argc+1 [L1585] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1586] argv[argc]=0 [L1587] int i=0; VAL [applet_name={-1:0}, argc=2, argv={-13:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, i=0, mem_track={-14:0}, optind=1] [L1587] COND TRUE i= 2u) [L1395] argv = argv + 1l [L1396] EXPR \read(**argv) [L1396] CALL, EXPR bb_get_last_path_component_strip(*argv) [L1443] char *slash; [L1444] CALL, EXPR last_char_is(path, 47) [L1482] COND TRUE !(s == ((const char *)((void *)0))) [L1484] EXPR \read(*s) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1484] COND FALSE !(!((signed int)*s == 0)) [L1495] return (char *)((void *)0); VAL [\result={0:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, c=47, dummy_utmp={11:0}, optind=1, s={-26:0}] [L1444] RET, EXPR last_char_is(path, 47) [L1444] slash=last_char_is(path, 47) [L1445] char *tmp_post$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-26:0}, slash={0:0}] [L1446] COND FALSE !(!(slash == ((char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1454] char *return_value_bb_get_last_path_component_nostrip$2; [L1455] CALL, EXPR bb_get_last_path_component_nostrip(path) [L1423] char *slash; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-26:0}] [L1424] slash=strrchr(path, 47) [L1425] _Bool tmp_if_expr$2; [L1426] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-26:0}, slash={0:0}] [L1427] COND TRUE slash == ((char *)((void *)0)) [L1428] tmp_if_expr$2 = 1 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, path={-26:0}, slash={0:0}, tmp_if_expr$2=1] [L1437] COND TRUE !(tmp_if_expr$2 == (_Bool)0) [L1438] return (char *)path; VAL [\result={-26:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1, slash={0:0}] [L1455] RET, EXPR bb_get_last_path_component_nostrip(path) [L1455] return_value_bb_get_last_path_component_nostrip$2=bb_get_last_path_component_nostrip(path) [L1456] return return_value_bb_get_last_path_component_nostrip$2; VAL [\result={-26:0}, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1396] RET, EXPR bb_get_last_path_component_strip(*argv) [L1396] s=bb_get_last_path_component_strip(*argv) [L1397] m=strlen(s) [L1398] argv = argv + 1l [L1399] signed int tmp_statement_expression$6; [L1400] EXPR \read(**argv) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1400] COND FALSE !(!(*argv == ((char *)((void *)0)))) [L1414] unsigned long int tmp_post$8 = m; [L1415] m = m + 1ul [L1416] s[(signed long int)tmp_post$8] = (char)10 [L1417] signed long int return_value_full_write$9; [L1418] CALL full_write(1, (const void *)s, m) [L1464] signed long int cc; [L1465] signed long int total = (signed long int)0; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, dummy_utmp={11:0}, fd=1, len=9223372036854776138U, optind=1, total=0] [L1466] COND TRUE !(len == 0ul) [L1468] CALL, EXPR safe_write(fd, buf, len) [L1499] signed long int n; [L1500] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, count=9223372036854776138U, dummy_utmp={11:0}, fd=1, optind=1] [L1509] COND TRUE tmp_if_expr$1 != (_Bool)0 [L1503] CALL, EXPR write(fd, buf, count) [L1569] long ret=__VERIFIER_nondet_long(); [L1570] CALL assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1570] RET assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=9223372036854776138U, optind=1, ret=9223372036854775807] [L1571] return ret; VAL [\result=9223372036854775807, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=9223372036854776138U, optind=1] [L1503] RET, EXPR write(fd, buf, count) [L1503] n=write(fd, buf, count) [L1504] COND FALSE !(n < 0l) [L1507] tmp_if_expr$1 = 0 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, count=9223372036854776138U, dummy_utmp={11:0}, fd=1, n=9223372036854775807, optind=1, tmp_if_expr$1=0] [L1509] COND FALSE !(tmp_if_expr$1 != (_Bool)0) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, count=9223372036854776138U, dummy_utmp={11:0}, fd=1, n=9223372036854775807, optind=1] [L1510] return n; VAL [\result=9223372036854775807, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, count=9223372036854776138U, dummy_utmp={11:0}, fd=1, optind=1] [L1468] RET, EXPR safe_write(fd, buf, len) [L1468] cc=safe_write(fd, buf, len) [L1469] COND FALSE !(cc < 0l) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:0}, cc=9223372036854775807, dummy_utmp={11:0}, fd=1, len=9223372036854776138U, optind=1, total=0] [L1475] EXPR total + cc [L1475] total = total + cc [L1476] buf = (const void *)((const char *)buf + cc) [L1466] len = len - (unsigned long int)cc VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:9223372036854775807}, dummy_utmp={11:0}, fd=1, len=331, optind=1, total=9223372036854775807] [L1466] COND TRUE !(len == 0ul) [L1468] CALL, EXPR safe_write(fd, buf, len) [L1499] signed long int n; [L1500] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:9223372036854775807}, count=331, dummy_utmp={11:0}, fd=1, optind=1] [L1509] COND TRUE tmp_if_expr$1 != (_Bool)0 [L1503] CALL, EXPR write(fd, buf, count) [L1569] long ret=__VERIFIER_nondet_long(); [L1570] CALL assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, optind=1] [L1570] RET assume_abort_if_not(ret==-1 || (ret >= 0 && ret<=nbyte)) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=331, optind=1, ret=331] [L1571] return ret; VAL [\result=331, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, dummy_utmp={11:0}, nbyte=331, optind=1] [L1503] RET, EXPR write(fd, buf, count) [L1503] n=write(fd, buf, count) [L1504] COND FALSE !(n < 0l) [L1507] tmp_if_expr$1 = 0 != 0 VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:9223372036854775807}, count=331, dummy_utmp={11:0}, fd=1, n=331, optind=1, tmp_if_expr$1=0] [L1509] COND FALSE !(tmp_if_expr$1 != (_Bool)0) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:9223372036854775807}, count=331, dummy_utmp={11:0}, fd=1, n=331, optind=1] [L1510] return n; VAL [\result=331, applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:9223372036854775807}, count=331, dummy_utmp={11:0}, fd=1, optind=1] [L1468] RET, EXPR safe_write(fd, buf, len) [L1468] cc=safe_write(fd, buf, len) [L1469] COND FALSE !(cc < 0l) VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:9223372036854775807}, cc=331, dummy_utmp={11:0}, fd=1, len=331, optind=1, total=9223372036854775807] [L1475] total + cc VAL [applet_name={-1:0}, bb_errno={10:0}, bb_errno_location={10:0}, buf={-26:9223372036854775807}, dummy_utmp={11:0}, fd=1, len=331, optind=1] - UnprovableResult [Line: 1596]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1596]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1475]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1390]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1390]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1379]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1366]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1366]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1361]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1361]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1356]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1356]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1587]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1587]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1592]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1592]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1585]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1585]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1584]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1577]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1577]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 157 edges, 24 error locations. Started 1 CEGAR loops. OverallTime: 22.7s, OverallIterations: 31, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 797 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 789 mSDsluCounter, 9719 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6551 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1061 IncrementalHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 3168 mSDtfsCounter, 1061 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2345 GetRequests, 2199 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=30, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 30 MinimizatonAttempts, 41 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 3661 NumberOfCodeBlocks, 3433 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 4343 ConstructedInterpolants, 0 QuantifiedInterpolants, 10568 SizeOfPredicates, 21 NumberOfNonLiveVariables, 22324 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 56 InterpolantComputations, 20 PerfectInterpolantSequences, 13208/16630 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-09 05:51:38,346 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/busybox-1.22.0/basename-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:51:40,207 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:51:40,282 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-03-09 05:51:40,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:51:40,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:51:40,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-03-09 05:51:40,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:51:40,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:51:40,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:51:40,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:51:40,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:51:40,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:51:40,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:51:40,314 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:51:40,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:51:40,314 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:51:40,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:51:40,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:51:40,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:51:40,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:51:40,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:51:40,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:51:40,315 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-09 05:51:40,315 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-09 05:51:40,315 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:51:40,316 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-09 05:51:40,316 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:51:40,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:51:40,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:51:40,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:51:40,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:51:40,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:51:40,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:51:40,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:51:40,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:51:40,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:51:40,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:51:40,317 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:51:40,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:51:40,317 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-09 05:51:40,318 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-09 05:51:40,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:51:40,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:51:40,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:51:40,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:51:40,318 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77d101c015aa227688f75df3fd905b74c24dd55f9fd8e8478582e7eae4d24583 [2025-03-09 05:51:40,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:51:40,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:51:40,607 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:51:40,609 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:51:40,609 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:51:40,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-03-09 05:51:41,790 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2b00cba/c46d149d0aaf45d8abdc0a49af1bc01e/FLAGf1cf192d8 [2025-03-09 05:51:42,096 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:51:42,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-03-09 05:51:42,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2b00cba/c46d149d0aaf45d8abdc0a49af1bc01e/FLAGf1cf192d8 [2025-03-09 05:51:42,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2b00cba/c46d149d0aaf45d8abdc0a49af1bc01e [2025-03-09 05:51:42,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:51:42,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:51:42,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:51:42,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:51:42,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:51:42,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:51:42" (1/1) ... [2025-03-09 05:51:42,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335ce92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42, skipping insertion in model container [2025-03-09 05:51:42,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:51:42" (1/1) ... [2025-03-09 05:51:42,393 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:51:42,695 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:51:42,707 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:51:42,710 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:51:42,713 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:51:42,716 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:51:42,721 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:51:42,722 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:51:42,722 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:51:42,723 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:51:42,725 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:51:42,738 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:51:42,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:51:42,762 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:51:42,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:51:42,984 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:51:42,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42 WrapperNode [2025-03-09 05:51:42,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:51:42,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:51:42,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:51:42,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:51:42,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42" (1/1) ... [2025-03-09 05:51:43,030 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42" (1/1) ... [2025-03-09 05:51:43,077 INFO L138 Inliner]: procedures = 353, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 717 [2025-03-09 05:51:43,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:51:43,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:51:43,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:51:43,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:51:43,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42" (1/1) ... [2025-03-09 05:51:43,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42" (1/1) ... [2025-03-09 05:51:43,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42" (1/1) ... [2025-03-09 05:51:43,160 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 2, 3, 3, 3, 4, 12, 4, 4, 12, 3, 3, 355, 2]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 0, 3, 3, 3, 3, 0, 3, 3, 0, 3, 1, 355, 0]. The 11 writes are split as follows [0, 1, 0, 0, 0, 0, 2, 0, 0, 5, 0, 1, 0, 2]. [2025-03-09 05:51:43,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42" (1/1) ... [2025-03-09 05:51:43,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42" (1/1) ... [2025-03-09 05:51:43,199 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42" (1/1) ... [2025-03-09 05:51:43,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42" (1/1) ... [2025-03-09 05:51:43,221 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42" (1/1) ... [2025-03-09 05:51:43,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42" (1/1) ... [2025-03-09 05:51:43,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:51:43,245 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:51:43,245 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:51:43,245 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:51:43,246 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42" (1/1) ... [2025-03-09 05:51:43,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:51:43,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:43,277 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 05:51:43,281 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 05:51:43,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-09 05:51:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-09 05:51:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-09 05:51:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-09 05:51:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-09 05:51:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-09 05:51:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-09 05:51:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-09 05:51:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-09 05:51:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-09 05:51:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-09 05:51:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-09 05:51:43,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-09 05:51:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-03-09 05:51:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-09 05:51:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-09 05:51:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-09 05:51:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-09 05:51:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-09 05:51:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-09 05:51:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-09 05:51:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-09 05:51:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-09 05:51:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-09 05:51:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-09 05:51:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-09 05:51:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-03-09 05:51:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-03-09 05:51:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:51:43,303 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:51:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 05:51:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 05:51:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 05:51:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 05:51:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 05:51:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 05:51:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-09 05:51:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-09 05:51:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-09 05:51:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-09 05:51:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-09 05:51:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-09 05:51:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-09 05:51:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-03-09 05:51:43,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-03-09 05:51:43,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 05:51:43,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-03-09 05:51:43,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-09 05:51:43,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:51:43,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:51:43,678 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:51:43,680 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:51:44,460 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2025-03-09 05:51:44,460 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:51:44,471 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:51:44,471 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:51:44,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:51:44 BoogieIcfgContainer [2025-03-09 05:51:44,472 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:51:44,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:51:44,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:51:44,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:51:44,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:51:42" (1/3) ... [2025-03-09 05:51:44,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ecabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:51:44, skipping insertion in model container [2025-03-09 05:51:44,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:51:42" (2/3) ... [2025-03-09 05:51:44,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11ecabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:51:44, skipping insertion in model container [2025-03-09 05:51:44,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:51:44" (3/3) ... [2025-03-09 05:51:44,482 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-2.i [2025-03-09 05:51:44,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:51:44,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-2.i that has 2 procedures, 117 locations, 1 initial locations, 7 loop locations, and 24 error locations. [2025-03-09 05:51:44,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:51:44,542 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;@50e1d869, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:51:44,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-09 05:51:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 89 states have (on average 1.696629213483146) internal successors, (151), 113 states have internal predecessors, (151), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:51:44,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:44,548 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:51:44,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:44,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:44,552 INFO L85 PathProgramCache]: Analyzing trace with hash 6309695, now seen corresponding path program 1 times [2025-03-09 05:51:44,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:44,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622619883] [2025-03-09 05:51:44,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:44,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:44,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:44,567 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 05:51:44,569 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 05:51:44,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:51:45,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:51:45,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:45,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:45,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 05:51:45,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:45,228 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 05:51:45,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:45,229 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:45,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622619883] [2025-03-09 05:51:45,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622619883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:45,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:45,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 05:51:45,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70223361] [2025-03-09 05:51:45,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:45,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 05:51:45,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:45,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 05:51:45,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 05:51:45,246 INFO L87 Difference]: Start difference. First operand has 117 states, 89 states have (on average 1.696629213483146) internal successors, (151), 113 states have internal predecessors, (151), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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 05:51:45,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:45,265 INFO L93 Difference]: Finished difference Result 211 states and 300 transitions. [2025-03-09 05:51:45,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 05:51:45,267 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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 05:51:45,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:45,273 INFO L225 Difference]: With dead ends: 211 [2025-03-09 05:51:45,273 INFO L226 Difference]: Without dead ends: 97 [2025-03-09 05:51:45,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 05:51:45,278 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:45,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:45,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-09 05:51:45,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-09 05:51:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.4761904761904763) internal successors, (124), 93 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2025-03-09 05:51:45,305 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 4 [2025-03-09 05:51:45,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:45,305 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2025-03-09 05:51:45,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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 05:51:45,306 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2025-03-09 05:51:45,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 05:51:45,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:45,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 05:51:45,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 05:51:45,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:45,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:45,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:45,508 INFO L85 PathProgramCache]: Analyzing trace with hash 195600684, now seen corresponding path program 1 times [2025-03-09 05:51:45,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:45,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1426708583] [2025-03-09 05:51:45,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:45,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:45,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:45,512 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 05:51:45,513 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 05:51:45,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 05:51:46,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 05:51:46,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:46,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:46,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:51:46,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:46,144 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 05:51:46,144 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:46,144 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:46,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426708583] [2025-03-09 05:51:46,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426708583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:46,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:46,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:51:46,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159746603] [2025-03-09 05:51:46,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:46,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:46,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:46,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:46,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:51:46,146 INFO L87 Difference]: Start difference. First operand 97 states and 128 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 05:51:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:46,189 INFO L93 Difference]: Finished difference Result 192 states and 254 transitions. [2025-03-09 05:51:46,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:46,190 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 05:51:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:46,191 INFO L225 Difference]: With dead ends: 192 [2025-03-09 05:51:46,191 INFO L226 Difference]: Without dead ends: 100 [2025-03-09 05:51:46,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 05:51:46,192 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:46,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-09 05:51:46,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-09 05:51:46,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 87 states have (on average 1.4597701149425288) internal successors, (127), 96 states have internal predecessors, (127), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2025-03-09 05:51:46,198 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 5 [2025-03-09 05:51:46,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:46,198 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2025-03-09 05:51:46,198 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 05:51:46,198 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2025-03-09 05:51:46,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:51:46,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:46,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:51:46,233 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 05:51:46,399 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 [2025-03-09 05:51:46,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:46,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1130501695, now seen corresponding path program 1 times [2025-03-09 05:51:46,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:46,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479876593] [2025-03-09 05:51:46,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:46,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:46,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:46,404 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 05:51:46,406 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 05:51:46,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:51:46,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:51:46,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:46,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:47,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:51:47,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:51:47,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:51:47,081 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:47,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479876593] [2025-03-09 05:51:47,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479876593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:51:47,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:51:47,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:51:47,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124652953] [2025-03-09 05:51:47,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:51:47,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:51:47,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:47,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:51:47,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:51:47,082 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 05:51:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:47,152 INFO L93 Difference]: Finished difference Result 195 states and 259 transitions. [2025-03-09 05:51:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:51:47,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 8 [2025-03-09 05:51:47,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:47,158 INFO L225 Difference]: With dead ends: 195 [2025-03-09 05:51:47,158 INFO L226 Difference]: Without dead ends: 103 [2025-03-09 05:51:47,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:47,159 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:47,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:47,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-09 05:51:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2025-03-09 05:51:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 96 states have internal predecessors, (127), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2025-03-09 05:51:47,171 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 8 [2025-03-09 05:51:47,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:47,171 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2025-03-09 05:51:47,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 05:51:47,172 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2025-03-09 05:51:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 05:51:47,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:47,172 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:47,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 05:51:47,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:47,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:47,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2016733370, now seen corresponding path program 1 times [2025-03-09 05:51:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:47,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1068964794] [2025-03-09 05:51:47,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:47,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:47,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:47,377 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 05:51:47,378 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 05:51:47,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 05:51:47,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 05:51:47,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:47,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:47,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:51:47,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:51:48,019 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:48,019 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:48,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068964794] [2025-03-09 05:51:48,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068964794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:48,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:48,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:51:48,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917143770] [2025-03-09 05:51:48,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:48,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:51:48,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:48,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:51:48,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:48,021 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:48,192 INFO L93 Difference]: Finished difference Result 100 states and 131 transitions. [2025-03-09 05:51:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:51:48,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-09 05:51:48,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:48,193 INFO L225 Difference]: With dead ends: 100 [2025-03-09 05:51:48,193 INFO L226 Difference]: Without dead ends: 98 [2025-03-09 05:51:48,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:48,194 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 111 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:48,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 346 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:51:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-09 05:51:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-09 05:51:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 94 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2025-03-09 05:51:48,203 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 16 [2025-03-09 05:51:48,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:48,204 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2025-03-09 05:51:48,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:48,204 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2025-03-09 05:51:48,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:51:48,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:48,205 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:48,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 05:51:48,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:48,406 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:48,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:48,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2098114320, now seen corresponding path program 1 times [2025-03-09 05:51:48,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:48,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777378702] [2025-03-09 05:51:48,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:48,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:48,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:48,409 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 05:51:48,409 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 05:51:48,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 05:51:48,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 05:51:48,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:48,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:49,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:51:49,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:51:49,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:49,060 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:49,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777378702] [2025-03-09 05:51:49,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777378702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:49,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:49,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:51:49,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577645959] [2025-03-09 05:51:49,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:49,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:49,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:49,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:49,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:51:49,061 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:49,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:49,177 INFO L93 Difference]: Finished difference Result 106 states and 139 transitions. [2025-03-09 05:51:49,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:49,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-09 05:51:49,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:49,179 INFO L225 Difference]: With dead ends: 106 [2025-03-09 05:51:49,179 INFO L226 Difference]: Without dead ends: 105 [2025-03-09 05:51:49,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 05:51:49,180 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 4 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:49,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 237 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:51:49,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-09 05:51:49,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-03-09 05:51:49,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 94 states have (on average 1.425531914893617) internal successors, (134), 100 states have internal predecessors, (134), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:49,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2025-03-09 05:51:49,191 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 22 [2025-03-09 05:51:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:49,194 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2025-03-09 05:51:49,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2025-03-09 05:51:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:51:49,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:49,195 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:49,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 05:51:49,395 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 [2025-03-09 05:51:49,396 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:49,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:49,396 INFO L85 PathProgramCache]: Analyzing trace with hash 2098119285, now seen corresponding path program 1 times [2025-03-09 05:51:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:49,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115201570] [2025-03-09 05:51:49,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:49,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:49,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:49,399 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 05:51:49,399 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 05:51:49,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 05:51:49,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 05:51:49,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:49,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:50,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:51:50,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:50,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:51:50,062 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:50,063 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:50,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115201570] [2025-03-09 05:51:50,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115201570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:50,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:50,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:51:50,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148498233] [2025-03-09 05:51:50,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:50,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:50,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:50,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:50,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:51:50,064 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:50,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:50,092 INFO L93 Difference]: Finished difference Result 196 states and 263 transitions. [2025-03-09 05:51:50,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:50,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-03-09 05:51:50,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:50,094 INFO L225 Difference]: With dead ends: 196 [2025-03-09 05:51:50,094 INFO L226 Difference]: Without dead ends: 110 [2025-03-09 05:51:50,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 05:51:50,095 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:50,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:50,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-09 05:51:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-09 05:51:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 100 states have (on average 1.4) internal successors, (140), 106 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 144 transitions. [2025-03-09 05:51:50,108 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 144 transitions. Word has length 22 [2025-03-09 05:51:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:50,108 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 144 transitions. [2025-03-09 05:51:50,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:50,108 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 144 transitions. [2025-03-09 05:51:50,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 05:51:50,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:50,108 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:50,138 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 05:51:50,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:50,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:50,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:50,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1136443579, now seen corresponding path program 1 times [2025-03-09 05:51:50,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:50,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [522751319] [2025-03-09 05:51:50,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:50,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:50,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:50,312 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 05:51:50,314 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 05:51:50,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 05:51:50,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 05:51:50,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:50,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:50,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:51:50,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:51:50,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:50,972 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:50,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522751319] [2025-03-09 05:51:50,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522751319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:50,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:50,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:51:50,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775729478] [2025-03-09 05:51:50,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:50,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:50,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:50,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:50,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:51:50,973 INFO L87 Difference]: Start difference. First operand 110 states and 144 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:50,993 INFO L93 Difference]: Finished difference Result 114 states and 148 transitions. [2025-03-09 05:51:50,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:50,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-09 05:51:50,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:50,994 INFO L225 Difference]: With dead ends: 114 [2025-03-09 05:51:50,994 INFO L226 Difference]: Without dead ends: 113 [2025-03-09 05:51:50,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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 05:51:50,996 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:50,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-09 05:51:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-09 05:51:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 109 states have internal predecessors, (143), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 147 transitions. [2025-03-09 05:51:51,005 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 147 transitions. Word has length 25 [2025-03-09 05:51:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:51,005 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 147 transitions. [2025-03-09 05:51:51,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 147 transitions. [2025-03-09 05:51:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 05:51:51,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:51,006 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:51,036 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 05:51:51,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:51,207 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:51,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:51,207 INFO L85 PathProgramCache]: Analyzing trace with hash 412686792, now seen corresponding path program 1 times [2025-03-09 05:51:51,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:51,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790673407] [2025-03-09 05:51:51,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:51,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:51,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:51,210 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 05:51:51,210 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 05:51:51,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 05:51:51,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 05:51:51,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:51,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:51,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:51:51,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:51:51,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:51,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:51:51,992 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:51,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790673407] [2025-03-09 05:51:51,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790673407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:51:51,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:51:51,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:51:51,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947710163] [2025-03-09 05:51:51,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:51:51,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:51:51,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:51,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:51:51,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:51:51,993 INFO L87 Difference]: Start difference. First operand 113 states and 147 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:52,094 INFO L93 Difference]: Finished difference Result 212 states and 282 transitions. [2025-03-09 05:51:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:51:52,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-09 05:51:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:52,095 INFO L225 Difference]: With dead ends: 212 [2025-03-09 05:51:52,095 INFO L226 Difference]: Without dead ends: 120 [2025-03-09 05:51:52,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:52,096 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:52,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 474 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:51:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-09 05:51:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2025-03-09 05:51:52,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 105 states have (on average 1.361904761904762) internal successors, (143), 110 states have internal predecessors, (143), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 147 transitions. [2025-03-09 05:51:52,101 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 147 transitions. Word has length 25 [2025-03-09 05:51:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:52,101 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 147 transitions. [2025-03-09 05:51:52,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 147 transitions. [2025-03-09 05:51:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:51:52,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:52,105 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:52,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 05:51:52,305 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 [2025-03-09 05:51:52,306 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:52,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:52,306 INFO L85 PathProgramCache]: Analyzing trace with hash -2023432423, now seen corresponding path program 1 times [2025-03-09 05:51:52,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:52,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [454492890] [2025-03-09 05:51:52,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:52,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:52,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:52,309 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:52,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 05:51:52,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:51:52,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:51:52,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:52,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:52,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 05:51:52,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:51:52,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:52,956 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:52,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454492890] [2025-03-09 05:51:52,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454492890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:52,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:52,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:51:52,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968839909] [2025-03-09 05:51:52,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:52,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:51:52,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:52,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:51:52,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:51:52,957 INFO L87 Difference]: Start difference. First operand 114 states and 147 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:53,193 INFO L93 Difference]: Finished difference Result 193 states and 253 transitions. [2025-03-09 05:51:53,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:51:53,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-03-09 05:51:53,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:53,194 INFO L225 Difference]: With dead ends: 193 [2025-03-09 05:51:53,194 INFO L226 Difference]: Without dead ends: 114 [2025-03-09 05:51:53,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:51:53,195 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 120 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:53,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 434 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:51:53,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-09 05:51:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-09 05:51:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 110 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 146 transitions. [2025-03-09 05:51:53,204 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 146 transitions. Word has length 27 [2025-03-09 05:51:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:53,204 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 146 transitions. [2025-03-09 05:51:53,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2025-03-09 05:51:53,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-09 05:51:53,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:53,210 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, 1, 1, 1, 1, 1] [2025-03-09 05:51:53,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 05:51:53,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:53,410 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:53,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:53,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1242656127, now seen corresponding path program 1 times [2025-03-09 05:51:53,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:53,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1483066323] [2025-03-09 05:51:53,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:53,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:53,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:53,414 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:53,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 05:51:53,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 05:51:54,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 05:51:54,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:54,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:54,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 05:51:54,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 05:51:54,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 05:51:54,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:54,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483066323] [2025-03-09 05:51:54,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483066323] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 05:51:54,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:51:54,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-09 05:51:54,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768532528] [2025-03-09 05:51:54,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:54,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:51:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:54,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:51:54,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:54,184 INFO L87 Difference]: Start difference. First operand 114 states and 146 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:54,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:54,306 INFO L93 Difference]: Finished difference Result 116 states and 149 transitions. [2025-03-09 05:51:54,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:51:54,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2025-03-09 05:51:54,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:54,308 INFO L225 Difference]: With dead ends: 116 [2025-03-09 05:51:54,308 INFO L226 Difference]: Without dead ends: 115 [2025-03-09 05:51:54,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:51:54,308 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 128 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:54,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 212 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:51:54,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-09 05:51:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2025-03-09 05:51:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 109 states have internal predecessors, (141), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 145 transitions. [2025-03-09 05:51:54,315 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 145 transitions. Word has length 37 [2025-03-09 05:51:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:54,316 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 145 transitions. [2025-03-09 05:51:54,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:54,316 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 145 transitions. [2025-03-09 05:51:54,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 05:51:54,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:54,316 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1] [2025-03-09 05:51:54,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 05:51:54,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:54,517 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:54,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:54,517 INFO L85 PathProgramCache]: Analyzing trace with hash -129225154, now seen corresponding path program 1 times [2025-03-09 05:51:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:54,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366312575] [2025-03-09 05:51:54,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:54,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:54,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:54,520 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:54,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 05:51:54,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 05:51:55,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 05:51:55,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:55,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:55,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:51:55,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 05:51:55,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:55,223 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 05:51:55,223 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:55,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366312575] [2025-03-09 05:51:55,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366312575] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:51:55,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:51:55,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:51:55,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872359363] [2025-03-09 05:51:55,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:51:55,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:51:55,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:55,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:51:55,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:51:55,224 INFO L87 Difference]: Start difference. First operand 113 states and 145 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:55,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:55,269 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2025-03-09 05:51:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:51:55,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2025-03-09 05:51:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:55,270 INFO L225 Difference]: With dead ends: 120 [2025-03-09 05:51:55,270 INFO L226 Difference]: Without dead ends: 103 [2025-03-09 05:51:55,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:55,271 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:55,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 353 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-09 05:51:55,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-09 05:51:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 99 states have internal predecessors, (127), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 131 transitions. [2025-03-09 05:51:55,275 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 131 transitions. Word has length 38 [2025-03-09 05:51:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:55,275 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 131 transitions. [2025-03-09 05:51:55,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2025-03-09 05:51:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 05:51:55,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:55,276 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:55,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 05:51:55,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:55,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:55,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:55,477 INFO L85 PathProgramCache]: Analyzing trace with hash 590201800, now seen corresponding path program 1 times [2025-03-09 05:51:55,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:55,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [357076560] [2025-03-09 05:51:55,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:55,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:55,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:55,479 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:55,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 05:51:55,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 05:51:56,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 05:51:56,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:56,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:56,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:51:56,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 05:51:56,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:51:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 05:51:56,275 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:56,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357076560] [2025-03-09 05:51:56,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357076560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:51:56,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:51:56,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:51:56,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172902447] [2025-03-09 05:51:56,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:51:56,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:51:56,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:56,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:51:56,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:51:56,276 INFO L87 Difference]: Start difference. First operand 103 states and 131 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:56,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:56,658 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2025-03-09 05:51:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:51:56,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2025-03-09 05:51:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:56,660 INFO L225 Difference]: With dead ends: 124 [2025-03-09 05:51:56,660 INFO L226 Difference]: Without dead ends: 123 [2025-03-09 05:51:56,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:51:56,661 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:56,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 05:51:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-09 05:51:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 93. [2025-03-09 05:51:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 89 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2025-03-09 05:51:56,664 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 38 [2025-03-09 05:51:56,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:56,664 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2025-03-09 05:51:56,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:56,664 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2025-03-09 05:51:56,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 05:51:56,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:56,665 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:56,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 05:51:56,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:56,865 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:56,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:56,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1615895382, now seen corresponding path program 1 times [2025-03-09 05:51:56,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:56,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1658340337] [2025-03-09 05:51:56,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:56,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:56,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:56,868 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:56,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 05:51:57,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 05:51:57,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 05:51:57,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:57,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:57,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:51:57,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-09 05:51:57,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:57,491 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:57,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658340337] [2025-03-09 05:51:57,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658340337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:57,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:57,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:51:57,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948822613] [2025-03-09 05:51:57,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:57,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:51:57,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:57,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:51:57,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:51:57,492 INFO L87 Difference]: Start difference. First operand 93 states and 120 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:57,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:57,500 INFO L93 Difference]: Finished difference Result 140 states and 183 transitions. [2025-03-09 05:51:57,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:51:57,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2025-03-09 05:51:57,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:57,502 INFO L225 Difference]: With dead ends: 140 [2025-03-09 05:51:57,502 INFO L226 Difference]: Without dead ends: 77 [2025-03-09 05:51:57,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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 05:51:57,502 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:57,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:57,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-09 05:51:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-09 05:51:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 73 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:57,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2025-03-09 05:51:57,505 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 40 [2025-03-09 05:51:57,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:57,506 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2025-03-09 05:51:57,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 05:51:57,506 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2025-03-09 05:51:57,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 05:51:57,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:57,507 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:57,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 05:51:57,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:57,707 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:57,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:57,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1272552508, now seen corresponding path program 1 times [2025-03-09 05:51:57,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:57,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1290453262] [2025-03-09 05:51:57,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:57,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:57,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:57,713 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:57,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 05:51:57,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 05:51:58,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 05:51:58,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:58,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:58,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:51:58,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 05:51:58,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:58,431 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:58,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290453262] [2025-03-09 05:51:58,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290453262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:58,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:58,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 05:51:58,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959228353] [2025-03-09 05:51:58,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:58,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:51:58,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:58,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:51:58,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:58,433 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:51:58,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:58,471 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2025-03-09 05:51:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:51:58,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 59 [2025-03-09 05:51:58,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:58,473 INFO L225 Difference]: With dead ends: 103 [2025-03-09 05:51:58,473 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 05:51:58,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:51:58,473 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:58,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 353 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:58,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 05:51:58,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2025-03-09 05:51:58,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 74 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2025-03-09 05:51:58,479 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 59 [2025-03-09 05:51:58,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:58,480 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-03-09 05:51:58,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:51:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2025-03-09 05:51:58,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 05:51:58,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:58,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:58,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 05:51:58,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:58,683 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:58,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1243923357, now seen corresponding path program 1 times [2025-03-09 05:51:58,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:58,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2103712699] [2025-03-09 05:51:58,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:58,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:58,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:58,685 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:58,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 05:51:58,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 05:51:59,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 05:51:59,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:51:59,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:51:59,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:51:59,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:51:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 05:51:59,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:51:59,380 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:51:59,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103712699] [2025-03-09 05:51:59,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103712699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:51:59,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:51:59,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 05:51:59,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112549136] [2025-03-09 05:51:59,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:51:59,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:51:59,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:51:59,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:51:59,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 05:51:59,381 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:51:59,406 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2025-03-09 05:51:59,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:51:59,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 59 [2025-03-09 05:51:59,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:51:59,407 INFO L225 Difference]: With dead ends: 93 [2025-03-09 05:51:59,407 INFO L226 Difference]: Without dead ends: 91 [2025-03-09 05:51:59,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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 05:51:59,408 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:51:59,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 180 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:51:59,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-09 05:51:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-09 05:51:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 86 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:51:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2025-03-09 05:51:59,413 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 59 [2025-03-09 05:51:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:51:59,414 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2025-03-09 05:51:59,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 05:51:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2025-03-09 05:51:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-09 05:51:59,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:51:59,415 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:51:59,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-09 05:51:59,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:59,615 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:51:59,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:51:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash -285733404, now seen corresponding path program 1 times [2025-03-09 05:51:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:51:59,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789402823] [2025-03-09 05:51:59,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:51:59,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:51:59,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:51:59,618 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:51:59,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 05:51:59,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-09 05:52:00,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-09 05:52:00,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:00,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:00,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:52:00,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-09 05:52:00,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:52:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-09 05:52:00,458 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:52:00,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789402823] [2025-03-09 05:52:00,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789402823] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:00,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:52:00,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-09 05:52:00,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570488895] [2025-03-09 05:52:00,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:00,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:00,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:52:00,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:00,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:52:00,459 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:52:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:00,478 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2025-03-09 05:52:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:00,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2025-03-09 05:52:00,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:00,479 INFO L225 Difference]: With dead ends: 91 [2025-03-09 05:52:00,479 INFO L226 Difference]: Without dead ends: 90 [2025-03-09 05:52:00,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:52:00,480 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 10 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:00,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 167 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-09 05:52:00,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-09 05:52:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 85 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:52:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2025-03-09 05:52:00,483 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 75 [2025-03-09 05:52:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:00,484 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2025-03-09 05:52:00,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 24.5) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:52:00,484 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2025-03-09 05:52:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-09 05:52:00,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:00,484 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:00,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 05:52:00,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:00,685 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:52:00,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash -267800945, now seen corresponding path program 1 times [2025-03-09 05:52:00,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:52:00,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123529102] [2025-03-09 05:52:00,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:00,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:00,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:00,688 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:52:00,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 05:52:00,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-09 05:52:01,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-09 05:52:01,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:01,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:01,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:52:01,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:01,478 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 05:52:01,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:52:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 05:52:01,517 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:52:01,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123529102] [2025-03-09 05:52:01,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123529102] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:52:01,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:52:01,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-09 05:52:01,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245268874] [2025-03-09 05:52:01,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:52:01,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 05:52:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:52:01,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 05:52:01,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:52:01,518 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 05:52:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:01,630 INFO L93 Difference]: Finished difference Result 183 states and 234 transitions. [2025-03-09 05:52:01,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 05:52:01,630 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 76 [2025-03-09 05:52:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:01,631 INFO L225 Difference]: With dead ends: 183 [2025-03-09 05:52:01,631 INFO L226 Difference]: Without dead ends: 102 [2025-03-09 05:52:01,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-09 05:52:01,632 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 10 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:01,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 500 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:52:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-09 05:52:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-09 05:52:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.2371134020618557) internal successors, (120), 97 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:52:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2025-03-09 05:52:01,637 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 76 [2025-03-09 05:52:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:01,638 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2025-03-09 05:52:01,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 05:52:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2025-03-09 05:52:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-09 05:52:01,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:01,639 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:01,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-09 05:52:01,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:01,840 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:52:01,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:01,840 INFO L85 PathProgramCache]: Analyzing trace with hash -57579825, now seen corresponding path program 2 times [2025-03-09 05:52:01,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:52:01,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1084604316] [2025-03-09 05:52:01,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:52:01,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:01,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:01,842 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:52:01,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 05:52:02,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-09 05:52:02,653 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-09 05:52:02,653 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:52:02,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:02,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:52:02,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-09 05:52:02,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:52:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-09 05:52:02,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:52:02,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084604316] [2025-03-09 05:52:02,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084604316] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:52:02,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:52:02,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-09 05:52:02,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761359929] [2025-03-09 05:52:02,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:52:02,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 05:52:02,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:52:02,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 05:52:02,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:52:02,976 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:52:03,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:03,456 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2025-03-09 05:52:03,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:52:03,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 88 [2025-03-09 05:52:03,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:03,458 INFO L225 Difference]: With dead ends: 188 [2025-03-09 05:52:03,458 INFO L226 Difference]: Without dead ends: 121 [2025-03-09 05:52:03,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:52:03,458 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 33 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:03,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 332 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 05:52:03,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-09 05:52:03,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2025-03-09 05:52:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 107 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 05:52:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 137 transitions. [2025-03-09 05:52:03,465 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 137 transitions. Word has length 88 [2025-03-09 05:52:03,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:03,465 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 137 transitions. [2025-03-09 05:52:03,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 05:52:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2025-03-09 05:52:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-09 05:52:03,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:03,467 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:03,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-09 05:52:03,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:03,667 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2025-03-09 05:52:03,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash 505561191, now seen corresponding path program 3 times [2025-03-09 05:52:03,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:52:03,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009387112] [2025-03-09 05:52:03,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 05:52:03,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:03,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:03,670 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 05:52:03,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-09 05:52:03,862 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 8 equivalence classes.