./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 798a7b37 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-?-798a7b3-m [2025-03-04 14:38:05,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:38:05,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 14:38:05,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:38:05,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:38:05,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:38:05,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:38:05,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:38:05,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:38:05,623 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:38:05,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:38:05,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:38:05,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:38:05,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:38:05,623 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:38:05,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:38:05,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:38:05,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:38:05,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:38:05,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:38:05,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:38:05,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:38:05,624 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:38:05,624 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:38:05,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:38:05,625 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:38:05,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:38:05,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:38:05,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:38:05,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:38:05,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:38:05,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:38:05,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:38:05,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:38:05,625 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:38:05,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:38:05,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:38:05,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:38:05,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:38:05,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:38:05,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:38:05,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:38:05,626 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-04 14:38:05,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:38:05,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:38:05,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:38:05,843 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:38:05,843 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:38:05,843 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-04 14:38:06,997 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b97cdf1/dfeefc1477cc4313a04c24e2722a9d22/FLAG4ffd5a18a [2025-03-04 14:38:07,284 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:38:07,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-03-04 14:38:07,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b97cdf1/dfeefc1477cc4313a04c24e2722a9d22/FLAG4ffd5a18a [2025-03-04 14:38:07,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2b97cdf1/dfeefc1477cc4313a04c24e2722a9d22 [2025-03-04 14:38:07,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:38:07,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:38:07,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:38:07,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:38:07,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:38:07,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:38:07" (1/1) ... [2025-03-04 14:38:07,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21dca4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:07, skipping insertion in model container [2025-03-04 14:38:07,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:38:07" (1/1) ... [2025-03-04 14:38:07,605 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:38:07,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:38:08,003 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:38:08,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:38:08,175 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:38:08,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:08 WrapperNode [2025-03-04 14:38:08,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:38:08,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:38:08,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:38:08,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:38:08,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:08" (1/1) ... [2025-03-04 14:38:08,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:08" (1/1) ... [2025-03-04 14:38:08,241 INFO L138 Inliner]: procedures = 346, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 725 [2025-03-04 14:38:08,241 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:38:08,242 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:38:08,242 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:38:08,242 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:38:08,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:08" (1/1) ... [2025-03-04 14:38:08,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:08" (1/1) ... [2025-03-04 14:38:08,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:08" (1/1) ... [2025-03-04 14:38:08,285 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 3, 355, 2, 12, 2, 12]. 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, 2, 2, 1, 5]. [2025-03-04 14:38:08,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:08" (1/1) ... [2025-03-04 14:38:08,285 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:08" (1/1) ... [2025-03-04 14:38:08,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:08" (1/1) ... [2025-03-04 14:38:08,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:08" (1/1) ... [2025-03-04 14:38:08,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:08" (1/1) ... [2025-03-04 14:38:08,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:08" (1/1) ... [2025-03-04 14:38:08,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:38:08,334 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:38:08,334 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:38:08,335 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:38:08,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:08" (1/1) ... [2025-03-04 14:38:08,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:38:08,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:08,359 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-04 14:38:08,361 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-04 14:38:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:38:08,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:38:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:38:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:38:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:38:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 14:38:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 14:38:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 14:38:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 14:38:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 14:38:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 14:38:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 14:38:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 14:38:08,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 14:38:08,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 14:38:08,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 14:38:08,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:38:08,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:38:08,618 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:38:08,621 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:38:09,066 INFO L? ?]: Removed 153 outVars from TransFormulas that were not future-live. [2025-03-04 14:38:09,067 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:38:09,078 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:38:09,080 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:38:09,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:38:09 BoogieIcfgContainer [2025-03-04 14:38:09,080 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:38:09,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:38:09,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:38:09,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:38:09,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:38:07" (1/3) ... [2025-03-04 14:38:09,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4463986a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:38:09, skipping insertion in model container [2025-03-04 14:38:09,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:08" (2/3) ... [2025-03-04 14:38:09,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4463986a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:38:09, skipping insertion in model container [2025-03-04 14:38:09,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:38:09" (3/3) ... [2025-03-04 14:38:09,090 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-2.i [2025-03-04 14:38:09,102 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:38:09,104 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-04 14:38:09,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:38:09,162 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;@79d6b833, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:38:09,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-04 14:38:09,165 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-04 14:38:09,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:38:09,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:09,170 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:38:09,171 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-04 14:38:09,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:09,176 INFO L85 PathProgramCache]: Analyzing trace with hash 6309695, now seen corresponding path program 1 times [2025-03-04 14:38:09,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:09,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928422390] [2025-03-04 14:38:09,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:09,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:09,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:38:09,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:38:09,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:09,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:09,704 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-04 14:38:09,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:09,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928422390] [2025-03-04 14:38:09,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928422390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:09,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:09,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:09,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837877202] [2025-03-04 14:38:09,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:09,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:09,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:09,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:09,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:09,728 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-04 14:38:09,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:09,775 INFO L93 Difference]: Finished difference Result 230 states and 308 transitions. [2025-03-04 14:38:09,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:09,776 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-04 14:38:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:09,782 INFO L225 Difference]: With dead ends: 230 [2025-03-04 14:38:09,782 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 14:38:09,786 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-04 14:38:09,788 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-04 14:38:09,790 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-04 14:38:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 14:38:09,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-04 14:38:09,821 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-04 14:38:09,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 145 transitions. [2025-03-04 14:38:09,830 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 145 transitions. Word has length 4 [2025-03-04 14:38:09,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:09,830 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 145 transitions. [2025-03-04 14:38:09,830 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-04 14:38:09,830 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 145 transitions. [2025-03-04 14:38:09,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:38:09,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:09,831 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-04 14:38:09,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:38:09,831 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-04 14:38:09,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:09,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1006299126, now seen corresponding path program 1 times [2025-03-04 14:38:09,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:09,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689768105] [2025-03-04 14:38:09,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:09,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:09,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:38:09,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:38:09,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:09,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:10,027 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-04 14:38:10,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:10,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689768105] [2025-03-04 14:38:10,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689768105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:10,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404464238] [2025-03-04 14:38:10,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:10,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:10,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:10,030 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-04 14:38:10,032 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-04 14:38:10,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:38:10,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:38:10,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:10,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:10,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:10,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:10,303 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-04 14:38:10,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:10,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404464238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:10,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:10,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:38:10,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588953958] [2025-03-04 14:38:10,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:10,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:38:10,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:10,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:38:10,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:10,307 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-04 14:38:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:10,337 INFO L93 Difference]: Finished difference Result 114 states and 145 transitions. [2025-03-04 14:38:10,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:38:10,338 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-04 14:38:10,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:10,339 INFO L225 Difference]: With dead ends: 114 [2025-03-04 14:38:10,339 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 14:38:10,339 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-04 14:38:10,339 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-04 14:38:10,340 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-04 14:38:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 14:38:10,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-04 14:38:10,346 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-04 14:38:10,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 144 transitions. [2025-03-04 14:38:10,347 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 144 transitions. Word has length 7 [2025-03-04 14:38:10,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:10,348 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 144 transitions. [2025-03-04 14:38:10,348 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-04 14:38:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 144 transitions. [2025-03-04 14:38:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:38:10,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:10,348 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:38:10,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:38:10,552 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-04 14:38:10,552 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-04 14:38:10,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:10,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1130501695, now seen corresponding path program 1 times [2025-03-04 14:38:10,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:10,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001305528] [2025-03-04 14:38:10,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:10,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:10,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:38:10,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:38:10,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:10,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:10,688 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-04 14:38:10,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:10,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001305528] [2025-03-04 14:38:10,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001305528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:10,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:10,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:10,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602933218] [2025-03-04 14:38:10,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:10,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:10,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:10,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:10,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:10,690 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-04 14:38:10,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:10,709 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2025-03-04 14:38:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:10,710 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-04 14:38:10,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:10,711 INFO L225 Difference]: With dead ends: 113 [2025-03-04 14:38:10,711 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 14:38:10,712 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-04 14:38:10,712 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-04 14:38:10,713 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-04 14:38:10,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 14:38:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2025-03-04 14:38:10,721 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-04 14:38:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 141 transitions. [2025-03-04 14:38:10,725 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 141 transitions. Word has length 8 [2025-03-04 14:38:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:10,725 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 141 transitions. [2025-03-04 14:38:10,725 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-04 14:38:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 141 transitions. [2025-03-04 14:38:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 14:38:10,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:10,725 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:10,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:38:10,726 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-04 14:38:10,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:10,727 INFO L85 PathProgramCache]: Analyzing trace with hash 649056, now seen corresponding path program 1 times [2025-03-04 14:38:10,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:10,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064315428] [2025-03-04 14:38:10,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:10,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:10,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:38:10,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:38:10,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:10,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:10,893 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-04 14:38:10,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:10,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064315428] [2025-03-04 14:38:10,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064315428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:10,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576842557] [2025-03-04 14:38:10,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:10,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:10,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:10,897 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-04 14:38:10,898 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-04 14:38:11,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 14:38:11,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 14:38:11,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:11,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:11,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:11,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:11,146 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-04 14:38:11,146 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:11,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576842557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:11,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:11,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 14:38:11,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542291486] [2025-03-04 14:38:11,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:11,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:11,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:11,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:11,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:11,148 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-04 14:38:11,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:11,175 INFO L93 Difference]: Finished difference Result 110 states and 141 transitions. [2025-03-04 14:38:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:11,176 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-04 14:38:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:11,177 INFO L225 Difference]: With dead ends: 110 [2025-03-04 14:38:11,177 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 14:38:11,177 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-04 14:38:11,179 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-04 14:38:11,179 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-04 14:38:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 14:38:11,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-04 14:38:11,189 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-04 14:38:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 139 transitions. [2025-03-04 14:38:11,190 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 139 transitions. Word has length 12 [2025-03-04 14:38:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:11,190 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 139 transitions. [2025-03-04 14:38:11,191 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-04 14:38:11,191 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 139 transitions. [2025-03-04 14:38:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 14:38:11,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:11,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:11,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:11,391 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-04 14:38:11,392 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-04 14:38:11,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:11,392 INFO L85 PathProgramCache]: Analyzing trace with hash 20120869, now seen corresponding path program 1 times [2025-03-04 14:38:11,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:11,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236143268] [2025-03-04 14:38:11,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:11,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:11,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:38:11,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:38:11,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:11,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:11,527 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-04 14:38:11,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:11,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236143268] [2025-03-04 14:38:11,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236143268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:11,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677022053] [2025-03-04 14:38:11,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:11,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:11,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:11,530 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-04 14:38:11,532 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-04 14:38:11,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 14:38:11,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 14:38:11,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:11,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:11,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:11,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:11,736 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-04 14:38:11,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:11,757 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-04 14:38:11,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677022053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:11,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:11,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:38:11,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129271981] [2025-03-04 14:38:11,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:11,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:38:11,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:11,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:38:11,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:11,759 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-04 14:38:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:11,787 INFO L93 Difference]: Finished difference Result 219 states and 283 transitions. [2025-03-04 14:38:11,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:11,790 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-04 14:38:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:11,790 INFO L225 Difference]: With dead ends: 219 [2025-03-04 14:38:11,790 INFO L226 Difference]: Without dead ends: 117 [2025-03-04 14:38:11,791 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-04 14:38:11,791 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-04 14:38:11,791 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-04 14:38:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-04 14:38:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-04 14:38:11,801 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-04 14:38:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 148 transitions. [2025-03-04 14:38:11,802 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 148 transitions. Word has length 13 [2025-03-04 14:38:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:11,802 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 148 transitions. [2025-03-04 14:38:11,803 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-04 14:38:11,803 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 148 transitions. [2025-03-04 14:38:11,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:38:11,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:11,803 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:11,811 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-04 14:38:12,004 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-04 14:38:12,004 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-04 14:38:12,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash -539754278, now seen corresponding path program 2 times [2025-03-04 14:38:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:12,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250754754] [2025-03-04 14:38:12,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:12,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:12,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 14:38:12,050 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-04 14:38:12,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:38:12,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:12,213 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-04 14:38:12,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:12,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250754754] [2025-03-04 14:38:12,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250754754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:12,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:12,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:38:12,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090967325] [2025-03-04 14:38:12,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:12,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:38:12,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:12,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:38:12,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:12,215 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-04 14:38:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:12,250 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2025-03-04 14:38:12,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:38:12,251 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-04 14:38:12,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:12,252 INFO L225 Difference]: With dead ends: 117 [2025-03-04 14:38:12,252 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 14:38:12,252 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-04 14:38:12,252 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-04 14:38:12,252 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-04 14:38:12,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 14:38:12,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-04 14:38:12,259 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-04 14:38:12,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 146 transitions. [2025-03-04 14:38:12,260 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 146 transitions. Word has length 22 [2025-03-04 14:38:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:12,261 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 146 transitions. [2025-03-04 14:38:12,261 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-04 14:38:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 146 transitions. [2025-03-04 14:38:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:38:12,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:12,261 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-04 14:38:12,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:38:12,262 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-04 14:38:12,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1612648966, now seen corresponding path program 1 times [2025-03-04 14:38:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685167776] [2025-03-04 14:38:12,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:12,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:38:12,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:38:12,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:12,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:12,411 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-04 14:38:12,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:12,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685167776] [2025-03-04 14:38:12,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685167776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:12,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:12,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:38:12,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977397630] [2025-03-04 14:38:12,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:12,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:12,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:12,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:12,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:12,414 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-04 14:38:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:12,431 INFO L93 Difference]: Finished difference Result 213 states and 276 transitions. [2025-03-04 14:38:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:12,431 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-04 14:38:12,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:12,432 INFO L225 Difference]: With dead ends: 213 [2025-03-04 14:38:12,432 INFO L226 Difference]: Without dead ends: 118 [2025-03-04 14:38:12,432 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-04 14:38:12,432 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-04 14:38:12,433 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-04 14:38:12,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-04 14:38:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-04 14:38:12,441 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-04 14:38:12,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2025-03-04 14:38:12,442 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 27 [2025-03-04 14:38:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:12,442 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2025-03-04 14:38:12,442 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-04 14:38:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2025-03-04 14:38:12,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:38:12,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:12,442 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-04 14:38:12,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 14:38:12,443 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-04 14:38:12,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:12,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1401004732, now seen corresponding path program 1 times [2025-03-04 14:38:12,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:12,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593917281] [2025-03-04 14:38:12,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:12,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:12,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:38:12,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:38:12,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:12,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:12,559 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-04 14:38:12,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:12,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593917281] [2025-03-04 14:38:12,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593917281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:12,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:12,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:12,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631323373] [2025-03-04 14:38:12,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:12,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:12,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:12,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:12,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:12,561 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-04 14:38:12,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:12,574 INFO L93 Difference]: Finished difference Result 123 states and 154 transitions. [2025-03-04 14:38:12,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:12,575 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-04 14:38:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:12,575 INFO L225 Difference]: With dead ends: 123 [2025-03-04 14:38:12,575 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 14:38:12,576 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-04 14:38:12,576 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-04 14:38:12,576 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-04 14:38:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 14:38:12,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-04 14:38:12,580 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-04 14:38:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 152 transitions. [2025-03-04 14:38:12,581 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 152 transitions. Word has length 30 [2025-03-04 14:38:12,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:12,581 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 152 transitions. [2025-03-04 14:38:12,581 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-04 14:38:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 152 transitions. [2025-03-04 14:38:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:38:12,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:12,582 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-04 14:38:12,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 14:38:12,582 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-04 14:38:12,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:12,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1073938285, now seen corresponding path program 1 times [2025-03-04 14:38:12,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:12,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360790435] [2025-03-04 14:38:12,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:12,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:12,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:38:12,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:38:12,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:12,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:12,722 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-04 14:38:12,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:12,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360790435] [2025-03-04 14:38:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360790435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:12,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:12,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:12,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285271211] [2025-03-04 14:38:12,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:12,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:12,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:12,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:12,725 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-04 14:38:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:12,751 INFO L93 Difference]: Finished difference Result 134 states and 167 transitions. [2025-03-04 14:38:12,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:12,751 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-04 14:38:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:12,752 INFO L225 Difference]: With dead ends: 134 [2025-03-04 14:38:12,752 INFO L226 Difference]: Without dead ends: 132 [2025-03-04 14:38:12,752 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-04 14:38:12,752 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-04 14:38:12,752 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-04 14:38:12,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-04 14:38:12,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2025-03-04 14:38:12,760 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-04 14:38:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 165 transitions. [2025-03-04 14:38:12,761 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 165 transitions. Word has length 30 [2025-03-04 14:38:12,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:12,761 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 165 transitions. [2025-03-04 14:38:12,762 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-04 14:38:12,762 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 165 transitions. [2025-03-04 14:38:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 14:38:12,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:12,763 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-04 14:38:12,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 14:38:12,764 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-04 14:38:12,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:12,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1073938125, now seen corresponding path program 1 times [2025-03-04 14:38:12,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:12,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668225318] [2025-03-04 14:38:12,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:12,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:38:12,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:38:12,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:12,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:12,917 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-04 14:38:12,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:12,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668225318] [2025-03-04 14:38:12,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668225318] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:12,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934079093] [2025-03-04 14:38:12,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:12,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:12,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:12,920 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-04 14:38:12,921 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-04 14:38:13,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 14:38:13,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 14:38:13,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:13,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:13,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:38:13,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:13,184 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-04 14:38:13,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:13,250 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-04 14:38:13,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934079093] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:13,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:13,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 14 [2025-03-04 14:38:13,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571667652] [2025-03-04 14:38:13,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:13,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 14:38:13,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:13,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 14:38:13,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 14:38:13,252 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-04 14:38:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:13,328 INFO L93 Difference]: Finished difference Result 262 states and 338 transitions. [2025-03-04 14:38:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 14:38:13,329 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-04 14:38:13,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:13,329 INFO L225 Difference]: With dead ends: 262 [2025-03-04 14:38:13,329 INFO L226 Difference]: Without dead ends: 147 [2025-03-04 14:38:13,330 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-04 14:38:13,330 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-04 14:38:13,330 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-04 14:38:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-04 14:38:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-04 14:38:13,334 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-04 14:38:13,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 181 transitions. [2025-03-04 14:38:13,335 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 181 transitions. Word has length 30 [2025-03-04 14:38:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:13,335 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 181 transitions. [2025-03-04 14:38:13,335 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-04 14:38:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 181 transitions. [2025-03-04 14:38:13,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:38:13,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:13,336 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-04 14:38:13,344 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-04 14:38:13,536 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-04 14:38:13,537 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-04 14:38:13,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:13,537 INFO L85 PathProgramCache]: Analyzing trace with hash 99149947, now seen corresponding path program 1 times [2025-03-04 14:38:13,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:13,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806502443] [2025-03-04 14:38:13,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:13,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:13,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:38:13,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:38:13,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:13,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:13,758 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-04 14:38:13,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:13,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806502443] [2025-03-04 14:38:13,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806502443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:13,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:13,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:38:13,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986204887] [2025-03-04 14:38:13,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:13,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:13,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:13,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:13,760 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-04 14:38:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:13,769 INFO L93 Difference]: Finished difference Result 207 states and 261 transitions. [2025-03-04 14:38:13,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:13,769 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-04 14:38:13,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:13,770 INFO L225 Difference]: With dead ends: 207 [2025-03-04 14:38:13,770 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 14:38:13,771 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-04 14:38:13,771 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-04 14:38:13,771 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-04 14:38:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 14:38:13,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-03-04 14:38:13,776 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-04 14:38:13,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2025-03-04 14:38:13,777 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 49 [2025-03-04 14:38:13,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:13,777 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2025-03-04 14:38:13,777 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-04 14:38:13,777 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2025-03-04 14:38:13,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 14:38:13,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:13,778 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-04 14:38:13,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:38:13,778 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-04 14:38:13,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:13,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1626790216, now seen corresponding path program 1 times [2025-03-04 14:38:13,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:13,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700555734] [2025-03-04 14:38:13,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:13,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:13,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 14:38:13,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 14:38:13,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:13,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:13,906 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-04 14:38:13,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:13,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700555734] [2025-03-04 14:38:13,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700555734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:13,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:13,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:13,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134410365] [2025-03-04 14:38:13,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:13,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:13,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:13,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:13,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:13,909 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-04 14:38:13,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:13,924 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2025-03-04 14:38:13,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:13,924 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-04 14:38:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:13,925 INFO L225 Difference]: With dead ends: 124 [2025-03-04 14:38:13,925 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 14:38:13,925 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-04 14:38:13,926 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-04 14:38:13,926 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-04 14:38:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 14:38:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2025-03-04 14:38:13,929 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-04 14:38:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2025-03-04 14:38:13,930 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 49 [2025-03-04 14:38:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:13,930 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2025-03-04 14:38:13,930 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-04 14:38:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2025-03-04 14:38:13,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 14:38:13,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:13,931 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-04 14:38:13,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 14:38:13,931 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-04 14:38:13,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:13,932 INFO L85 PathProgramCache]: Analyzing trace with hash 793820825, now seen corresponding path program 1 times [2025-03-04 14:38:13,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:13,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691609389] [2025-03-04 14:38:13,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:13,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:13,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 14:38:14,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 14:38:14,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:14,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:14,229 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-04 14:38:14,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:14,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691609389] [2025-03-04 14:38:14,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691609389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:14,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:14,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:38:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107188634] [2025-03-04 14:38:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:14,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:14,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:14,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:14,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:14,232 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-04 14:38:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:14,288 INFO L93 Difference]: Finished difference Result 184 states and 232 transitions. [2025-03-04 14:38:14,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:14,289 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-04 14:38:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:14,289 INFO L225 Difference]: With dead ends: 184 [2025-03-04 14:38:14,289 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 14:38:14,290 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-04 14:38:14,290 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:14,290 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.0s Time] [2025-03-04 14:38:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 14:38:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-04 14:38:14,296 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-04 14:38:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2025-03-04 14:38:14,297 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 51 [2025-03-04 14:38:14,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:14,297 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2025-03-04 14:38:14,298 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-04 14:38:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2025-03-04 14:38:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 14:38:14,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:14,300 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-04 14:38:14,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 14:38:14,300 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-04 14:38:14,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1171928958, now seen corresponding path program 1 times [2025-03-04 14:38:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:14,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093470371] [2025-03-04 14:38:14,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:14,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:38:14,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:38:14,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:14,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:14,460 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-04 14:38:14,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:14,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093470371] [2025-03-04 14:38:14,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093470371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:14,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741676217] [2025-03-04 14:38:14,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:14,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:14,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:14,462 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-04 14:38:14,464 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-04 14:38:14,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 14:38:14,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 14:38:14,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:14,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:14,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:14,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:14,756 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-04 14:38:14,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:14,777 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-04 14:38:14,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741676217] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:14,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:14,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 14:38:14,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098996184] [2025-03-04 14:38:14,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:14,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:38:14,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:14,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:38:14,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:14,780 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-04 14:38:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:14,803 INFO L93 Difference]: Finished difference Result 213 states and 268 transitions. [2025-03-04 14:38:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:14,803 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-04 14:38:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:14,804 INFO L225 Difference]: With dead ends: 213 [2025-03-04 14:38:14,804 INFO L226 Difference]: Without dead ends: 137 [2025-03-04 14:38:14,804 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-04 14:38:14,805 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-04 14:38:14,805 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-04 14:38:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-04 14:38:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-03-04 14:38:14,809 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-04 14:38:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 163 transitions. [2025-03-04 14:38:14,810 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 163 transitions. Word has length 55 [2025-03-04 14:38:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:14,810 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 163 transitions. [2025-03-04 14:38:14,810 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-04 14:38:14,810 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 163 transitions. [2025-03-04 14:38:14,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-04 14:38:14,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:14,813 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-04 14:38:14,822 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-04 14:38:15,013 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-04 14:38:15,014 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-04 14:38:15,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:15,014 INFO L85 PathProgramCache]: Analyzing trace with hash -342658335, now seen corresponding path program 1 times [2025-03-04 14:38:15,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:15,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055437766] [2025-03-04 14:38:15,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:15,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:15,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 14:38:15,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 14:38:15,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:15,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:15,250 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-04 14:38:15,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:15,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055437766] [2025-03-04 14:38:15,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055437766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:15,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568866244] [2025-03-04 14:38:15,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:15,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:15,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:15,252 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-04 14:38:15,256 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-04 14:38:15,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 14:38:15,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 14:38:15,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:15,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:15,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 1296 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:38:15,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:15,572 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-04 14:38:15,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:15,630 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-04 14:38:15,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568866244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:15,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:15,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-04 14:38:15,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110250835] [2025-03-04 14:38:15,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:15,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 14:38:15,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:15,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 14:38:15,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:38:15,646 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-04 14:38:15,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:15,696 INFO L93 Difference]: Finished difference Result 258 states and 319 transitions. [2025-03-04 14:38:15,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 14:38:15,696 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-04 14:38:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:15,698 INFO L225 Difference]: With dead ends: 258 [2025-03-04 14:38:15,698 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 14:38:15,699 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-04 14:38:15,699 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-04 14:38:15,700 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-04 14:38:15,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 14:38:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-04 14:38:15,708 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-04 14:38:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 199 transitions. [2025-03-04 14:38:15,709 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 199 transitions. Word has length 67 [2025-03-04 14:38:15,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:15,709 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 199 transitions. [2025-03-04 14:38:15,709 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-04 14:38:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 199 transitions. [2025-03-04 14:38:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 14:38:15,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:15,711 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-04 14:38:15,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:15,911 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-04 14:38:15,912 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-04 14:38:15,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:15,913 INFO L85 PathProgramCache]: Analyzing trace with hash 357672321, now seen corresponding path program 2 times [2025-03-04 14:38:15,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:15,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097541565] [2025-03-04 14:38:15,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:15,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:15,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-03-04 14:38:15,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 85 statements. [2025-03-04 14:38:15,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:38:15,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:16,130 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-04 14:38:16,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:16,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097541565] [2025-03-04 14:38:16,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097541565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:16,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:16,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:38:16,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674887252] [2025-03-04 14:38:16,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:16,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:16,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:16,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:16,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:16,132 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-04 14:38:16,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:16,201 INFO L93 Difference]: Finished difference Result 175 states and 202 transitions. [2025-03-04 14:38:16,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:16,202 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-04 14:38:16,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:16,203 INFO L225 Difference]: With dead ends: 175 [2025-03-04 14:38:16,203 INFO L226 Difference]: Without dead ends: 174 [2025-03-04 14:38:16,203 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-04 14:38:16,203 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-04 14:38:16,204 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-04 14:38:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-04 14:38:16,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2025-03-04 14:38:16,215 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-04 14:38:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 198 transitions. [2025-03-04 14:38:16,217 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 198 transitions. Word has length 85 [2025-03-04 14:38:16,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:16,218 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 198 transitions. [2025-03-04 14:38:16,219 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-04 14:38:16,219 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 198 transitions. [2025-03-04 14:38:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 14:38:16,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:16,219 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-04 14:38:16,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:38:16,219 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-04 14:38:16,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:16,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1180517899, now seen corresponding path program 1 times [2025-03-04 14:38:16,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:16,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366639094] [2025-03-04 14:38:16,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:16,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:16,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 14:38:16,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 14:38:16,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:16,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:16,379 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-04 14:38:16,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:16,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366639094] [2025-03-04 14:38:16,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366639094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:16,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277386041] [2025-03-04 14:38:16,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:16,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:16,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:16,382 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-04 14:38:16,383 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-04 14:38:16,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 14:38:16,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 14:38:16,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:16,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:16,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 1448 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:16,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:16,711 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-04 14:38:16,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:16,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277386041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:16,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:16,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:38:16,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667478342] [2025-03-04 14:38:16,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:16,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:38:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:16,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:38:16,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:16,712 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-04 14:38:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:16,730 INFO L93 Difference]: Finished difference Result 172 states and 198 transitions. [2025-03-04 14:38:16,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:38:16,731 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-04 14:38:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:16,731 INFO L225 Difference]: With dead ends: 172 [2025-03-04 14:38:16,731 INFO L226 Difference]: Without dead ends: 171 [2025-03-04 14:38:16,732 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-04 14:38:16,732 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-04 14:38:16,732 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-04 14:38:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-04 14:38:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-03-04 14:38:16,744 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-04 14:38:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 197 transitions. [2025-03-04 14:38:16,745 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 197 transitions. Word has length 85 [2025-03-04 14:38:16,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:16,745 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 197 transitions. [2025-03-04 14:38:16,745 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-04 14:38:16,745 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 197 transitions. [2025-03-04 14:38:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 14:38:16,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:16,746 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-04 14:38:16,755 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-04 14:38:16,950 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-04 14:38:16,950 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-04 14:38:16,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1797059870, now seen corresponding path program 1 times [2025-03-04 14:38:16,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:16,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859742549] [2025-03-04 14:38:16,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:16,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:16,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 14:38:17,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 14:38:17,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:17,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:17,190 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-04 14:38:17,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:17,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859742549] [2025-03-04 14:38:17,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859742549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:17,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159038532] [2025-03-04 14:38:17,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:17,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:17,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:17,193 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-04 14:38:17,194 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-04 14:38:17,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 14:38:17,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 14:38:17,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:17,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:17,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 1435 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:38:17,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:17,575 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-04 14:38:17,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:17,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159038532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:17,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:17,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 14:38:17,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617457614] [2025-03-04 14:38:17,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:17,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:38:17,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:17,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:38:17,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:17,577 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-04 14:38:17,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:17,605 INFO L93 Difference]: Finished difference Result 171 states and 197 transitions. [2025-03-04 14:38:17,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:38:17,606 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-04 14:38:17,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:17,606 INFO L225 Difference]: With dead ends: 171 [2025-03-04 14:38:17,606 INFO L226 Difference]: Without dead ends: 170 [2025-03-04 14:38:17,607 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-04 14:38:17,607 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-04 14:38:17,607 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-04 14:38:17,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-04 14:38:17,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-04 14:38:17,612 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-04 14:38:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 196 transitions. [2025-03-04 14:38:17,613 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 196 transitions. Word has length 86 [2025-03-04 14:38:17,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:17,613 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 196 transitions. [2025-03-04 14:38:17,613 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-04 14:38:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 196 transitions. [2025-03-04 14:38:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 14:38:17,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:17,614 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-04 14:38:17,623 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-04 14:38:17,814 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-04 14:38:17,815 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-04 14:38:17,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:17,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2058650818, now seen corresponding path program 1 times [2025-03-04 14:38:17,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:17,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541374887] [2025-03-04 14:38:17,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:17,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 14:38:17,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 14:38:17,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:17,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:17,974 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-04 14:38:17,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:17,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541374887] [2025-03-04 14:38:17,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541374887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:17,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909253988] [2025-03-04 14:38:17,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:17,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:17,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:17,977 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-04 14:38:17,979 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-04 14:38:18,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 14:38:18,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 14:38:18,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:18,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:18,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:18,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:18,342 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-04 14:38:18,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:18,361 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-04 14:38:18,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909253988] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:18,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:18,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:38:18,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067444972] [2025-03-04 14:38:18,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:18,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:38:18,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:18,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:38:18,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:18,363 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-04 14:38:18,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:18,388 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2025-03-04 14:38:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:18,388 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-04 14:38:18,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:18,389 INFO L225 Difference]: With dead ends: 180 [2025-03-04 14:38:18,389 INFO L226 Difference]: Without dead ends: 179 [2025-03-04 14:38:18,389 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-04 14:38:18,389 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-04 14:38:18,389 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-04 14:38:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-04 14:38:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-03-04 14:38:18,396 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-04 14:38:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 205 transitions. [2025-03-04 14:38:18,397 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 205 transitions. Word has length 86 [2025-03-04 14:38:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:18,398 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 205 transitions. [2025-03-04 14:38:18,398 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-04 14:38:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 205 transitions. [2025-03-04 14:38:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 14:38:18,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:18,398 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-04 14:38:18,408 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-04 14:38:18,603 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-04 14:38:18,603 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-04 14:38:18,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:18,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1230851181, now seen corresponding path program 2 times [2025-03-04 14:38:18,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:18,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112312810] [2025-03-04 14:38:18,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:18,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-04 14:38:18,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 95 statements. [2025-03-04 14:38:18,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:38:18,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:18,729 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-04 14:38:18,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:18,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112312810] [2025-03-04 14:38:18,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112312810] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:18,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914923855] [2025-03-04 14:38:18,729 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:18,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:18,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:18,731 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-04 14:38:18,733 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-04 14:38:18,965 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-04 14:38:19,040 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 95 statements. [2025-03-04 14:38:19,041 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 14:38:19,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:19,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:19,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:19,096 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-04 14:38:19,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:19,156 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-04 14:38:19,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914923855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:19,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:19,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-04 14:38:19,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951671250] [2025-03-04 14:38:19,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:19,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:19,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:19,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:19,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:19,158 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-04 14:38:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:19,191 INFO L93 Difference]: Finished difference Result 179 states and 205 transitions. [2025-03-04 14:38:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:19,192 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-04 14:38:19,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:19,192 INFO L225 Difference]: With dead ends: 179 [2025-03-04 14:38:19,193 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 14:38:19,193 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-04 14:38:19,194 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-04 14:38:19,194 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-04 14:38:19,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 14:38:19,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-03-04 14:38:19,200 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-04 14:38:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 182 transitions. [2025-03-04 14:38:19,201 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 182 transitions. Word has length 95 [2025-03-04 14:38:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:19,201 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 182 transitions. [2025-03-04 14:38:19,201 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-04 14:38:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 182 transitions. [2025-03-04 14:38:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 14:38:19,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:19,202 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-04 14:38:19,210 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-04 14:38:19,402 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-04 14:38:19,402 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-04 14:38:19,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:19,403 INFO L85 PathProgramCache]: Analyzing trace with hash -978766140, now seen corresponding path program 1 times [2025-03-04 14:38:19,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:19,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749642044] [2025-03-04 14:38:19,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:19,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:19,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 14:38:19,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 14:38:19,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:19,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:19,584 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-04 14:38:19,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:19,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749642044] [2025-03-04 14:38:19,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749642044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:19,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:19,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:38:19,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979340961] [2025-03-04 14:38:19,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:19,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:38:19,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:19,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:38:19,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:38:19,585 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-04 14:38:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:19,600 INFO L93 Difference]: Finished difference Result 173 states and 199 transitions. [2025-03-04 14:38:19,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:38:19,600 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-04 14:38:19,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:19,601 INFO L225 Difference]: With dead ends: 173 [2025-03-04 14:38:19,601 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 14:38:19,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:38:19,603 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-04 14:38:19,603 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-04 14:38:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 14:38:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2025-03-04 14:38:19,607 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-04 14:38:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 196 transitions. [2025-03-04 14:38:19,609 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 196 transitions. Word has length 107 [2025-03-04 14:38:19,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:19,609 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 196 transitions. [2025-03-04 14:38:19,609 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-04 14:38:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 196 transitions. [2025-03-04 14:38:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 14:38:19,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:19,610 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-04 14:38:19,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 14:38:19,610 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-04 14:38:19,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:19,611 INFO L85 PathProgramCache]: Analyzing trace with hash -276979281, now seen corresponding path program 1 times [2025-03-04 14:38:19,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:19,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917965997] [2025-03-04 14:38:19,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:19,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:19,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 14:38:19,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 14:38:19,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:19,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:19,802 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-04 14:38:19,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:19,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917965997] [2025-03-04 14:38:19,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917965997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:19,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:19,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:38:19,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690565486] [2025-03-04 14:38:19,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:19,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:38:19,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:19,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:38:19,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:19,803 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-04 14:38:19,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:19,823 INFO L93 Difference]: Finished difference Result 206 states and 237 transitions. [2025-03-04 14:38:19,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:38:19,823 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-04 14:38:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:19,825 INFO L225 Difference]: With dead ends: 206 [2025-03-04 14:38:19,825 INFO L226 Difference]: Without dead ends: 181 [2025-03-04 14:38:19,826 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-04 14:38:19,827 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-04 14:38:19,827 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-04 14:38:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-04 14:38:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2025-03-04 14:38:19,835 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-04 14:38:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2025-03-04 14:38:19,836 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 108 [2025-03-04 14:38:19,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:19,836 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2025-03-04 14:38:19,836 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-04 14:38:19,836 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2025-03-04 14:38:19,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 14:38:19,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:19,837 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-04 14:38:19,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 14:38:19,837 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-04 14:38:19,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:19,837 INFO L85 PathProgramCache]: Analyzing trace with hash 610524400, now seen corresponding path program 1 times [2025-03-04 14:38:19,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:19,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101733783] [2025-03-04 14:38:19,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:19,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:19,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 14:38:19,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 14:38:19,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:19,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:20,089 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-04 14:38:20,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:20,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101733783] [2025-03-04 14:38:20,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101733783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:20,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:20,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 14:38:20,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376073809] [2025-03-04 14:38:20,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:20,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 14:38:20,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:20,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 14:38:20,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:38:20,090 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-04 14:38:20,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:20,144 INFO L93 Difference]: Finished difference Result 179 states and 205 transitions. [2025-03-04 14:38:20,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 14:38:20,145 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-04 14:38:20,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:20,145 INFO L225 Difference]: With dead ends: 179 [2025-03-04 14:38:20,145 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 14:38:20,146 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-04 14:38:20,146 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:20,146 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.0s Time] [2025-03-04 14:38:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 14:38:20,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2025-03-04 14:38:20,150 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-04 14:38:20,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 199 transitions. [2025-03-04 14:38:20,151 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 199 transitions. Word has length 108 [2025-03-04 14:38:20,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:20,151 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 199 transitions. [2025-03-04 14:38:20,151 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-04 14:38:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 199 transitions. [2025-03-04 14:38:20,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 14:38:20,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:20,152 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-04 14:38:20,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 14:38:20,152 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-04 14:38:20,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1732073710, now seen corresponding path program 2 times [2025-03-04 14:38:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:20,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441404936] [2025-03-04 14:38:20,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:20,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:20,193 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-04 14:38:20,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 14:38:20,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:38:20,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:20,378 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-04 14:38:20,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:20,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441404936] [2025-03-04 14:38:20,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441404936] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:20,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025710102] [2025-03-04 14:38:20,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:20,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:20,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:20,381 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-04 14:38:20,382 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-04 14:38:20,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-04 14:38:20,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 14:38:20,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:38:20,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:20,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 1678 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:20,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:20,917 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-04 14:38:20,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:20,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025710102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:20,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:20,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 14:38:20,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195961601] [2025-03-04 14:38:20,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:20,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:38:20,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:20,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:38:20,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:20,918 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-04 14:38:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:20,940 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2025-03-04 14:38:20,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:38:20,941 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-04 14:38:20,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:20,942 INFO L225 Difference]: With dead ends: 174 [2025-03-04 14:38:20,942 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 14:38:20,942 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-04 14:38:20,942 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-04 14:38:20,942 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-04 14:38:20,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 14:38:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-04 14:38:20,946 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-04 14:38:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2025-03-04 14:38:20,947 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 109 [2025-03-04 14:38:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:20,947 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2025-03-04 14:38:20,948 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-04 14:38:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2025-03-04 14:38:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 14:38:20,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:20,948 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-04 14:38:20,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:21,149 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-04 14:38:21,149 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-04 14:38:21,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:21,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2140289720, now seen corresponding path program 1 times [2025-03-04 14:38:21,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:21,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322051942] [2025-03-04 14:38:21,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:21,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:21,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 14:38:21,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 14:38:21,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:21,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:21,398 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-04 14:38:21,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:21,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322051942] [2025-03-04 14:38:21,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322051942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:21,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621426515] [2025-03-04 14:38:21,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:21,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:21,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:21,400 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-04 14:38:21,402 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-04 14:38:21,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 14:38:21,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 14:38:21,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:21,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:21,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:21,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:21,900 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-04 14:38:21,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:21,963 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-04 14:38:21,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621426515] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:21,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:21,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 14:38:21,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588217423] [2025-03-04 14:38:21,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:21,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:38:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:21,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:38:21,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:21,964 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-04 14:38:22,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:22,003 INFO L93 Difference]: Finished difference Result 276 states and 309 transitions. [2025-03-04 14:38:22,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:22,004 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-04 14:38:22,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:22,005 INFO L225 Difference]: With dead ends: 276 [2025-03-04 14:38:22,005 INFO L226 Difference]: Without dead ends: 275 [2025-03-04 14:38:22,005 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-04 14:38:22,005 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-04 14:38:22,005 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-04 14:38:22,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-04 14:38:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2025-03-04 14:38:22,011 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-04 14:38:22,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 306 transitions. [2025-03-04 14:38:22,012 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 306 transitions. Word has length 110 [2025-03-04 14:38:22,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:22,012 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 306 transitions. [2025-03-04 14:38:22,013 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-04 14:38:22,013 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 306 transitions. [2025-03-04 14:38:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 14:38:22,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:22,013 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-04 14:38:22,022 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-04 14:38:22,214 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-04 14:38:22,214 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-04 14:38:22,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:22,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1099636508, now seen corresponding path program 1 times [2025-03-04 14:38:22,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:22,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610907270] [2025-03-04 14:38:22,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:22,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:22,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 14:38:22,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 14:38:22,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:22,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:22,420 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-04 14:38:22,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610907270] [2025-03-04 14:38:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610907270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047658433] [2025-03-04 14:38:22,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:22,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:22,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:22,424 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-04 14:38:22,425 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-04 14:38:22,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 14:38:22,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 14:38:22,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:22,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:22,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 1685 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:38:22,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:22,932 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-04 14:38:22,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:22,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047658433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:22,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:22,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-04 14:38:22,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273297762] [2025-03-04 14:38:22,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:22,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:38:22,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:22,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:38:22,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:22,934 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-04 14:38:22,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:22,946 INFO L93 Difference]: Finished difference Result 275 states and 306 transitions. [2025-03-04 14:38:22,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:38:22,947 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-04 14:38:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:22,948 INFO L225 Difference]: With dead ends: 275 [2025-03-04 14:38:22,948 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 14:38:22,948 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-04 14:38:22,948 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-04 14:38:22,948 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-04 14:38:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 14:38:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-03-04 14:38:22,955 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-04 14:38:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 305 transitions. [2025-03-04 14:38:22,955 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 305 transitions. Word has length 123 [2025-03-04 14:38:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:22,956 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 305 transitions. [2025-03-04 14:38:22,956 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-04 14:38:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 305 transitions. [2025-03-04 14:38:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 14:38:22,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:22,956 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-04 14:38:22,969 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-04 14:38:23,157 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-04 14:38:23,157 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-04 14:38:23,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:23,158 INFO L85 PathProgramCache]: Analyzing trace with hash 271006607, now seen corresponding path program 1 times [2025-03-04 14:38:23,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:23,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859870243] [2025-03-04 14:38:23,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:23,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:23,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 14:38:23,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 14:38:23,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:23,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:23,499 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-04 14:38:23,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859870243] [2025-03-04 14:38:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859870243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878786554] [2025-03-04 14:38:23,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:23,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:23,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:23,503 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-04 14:38:23,504 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-04 14:38:23,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 14:38:23,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 14:38:23,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:23,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:23,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 1686 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 14:38:23,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:24,090 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-04 14:38:24,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:24,273 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-04 14:38:24,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878786554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:24,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:24,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-04 14:38:24,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472815091] [2025-03-04 14:38:24,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:24,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 14:38:24,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:24,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 14:38:24,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:38:24,275 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-04 14:38:24,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:24,378 INFO L93 Difference]: Finished difference Result 341 states and 392 transitions. [2025-03-04 14:38:24,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:38:24,378 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-04 14:38:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:24,379 INFO L225 Difference]: With dead ends: 341 [2025-03-04 14:38:24,379 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 14:38:24,379 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-04 14:38:24,380 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-04 14:38:24,380 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-04 14:38:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 14:38:24,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-03-04 14:38:24,389 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-04 14:38:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 304 transitions. [2025-03-04 14:38:24,390 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 304 transitions. Word has length 124 [2025-03-04 14:38:24,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:24,390 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 304 transitions. [2025-03-04 14:38:24,390 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-04 14:38:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 304 transitions. [2025-03-04 14:38:24,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 14:38:24,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:24,391 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-04 14:38:24,401 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-04 14:38:24,591 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-04 14:38:24,592 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-04 14:38:24,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:24,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1616566695, now seen corresponding path program 2 times [2025-03-04 14:38:24,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:24,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576125623] [2025-03-04 14:38:24,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:24,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:24,645 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-03-04 14:38:24,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 14:38:24,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:38:24,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:25,708 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-04 14:38:25,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:25,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576125623] [2025-03-04 14:38:25,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576125623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:25,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914476472] [2025-03-04 14:38:25,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:25,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:25,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:25,710 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-04 14:38:25,711 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-04 14:38:26,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-03-04 14:38:26,247 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 14:38:26,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:38:26,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:26,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 1970 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 14:38:26,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:26,319 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-04 14:38:26,387 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-04 14:38:26,394 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 8 proven. 396 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-04 14:38:26,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:26,449 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-04 14:38:26,452 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-04 14:38:26,486 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-04 14:38:26,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914476472] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:26,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:26,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 13 [2025-03-04 14:38:26,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344677982] [2025-03-04 14:38:26,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:26,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 14:38:26,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:26,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 14:38:26,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:38:26,488 INFO L87 Difference]: Start difference. First operand 274 states and 304 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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-04 14:38:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:26,566 INFO L93 Difference]: Finished difference Result 329 states and 377 transitions. [2025-03-04 14:38:26,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:38:26,567 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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-04 14:38:26,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:26,568 INFO L225 Difference]: With dead ends: 329 [2025-03-04 14:38:26,568 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 14:38:26,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:38:26,569 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 16 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:26,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 641 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 14:38:26,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-03-04 14:38:26,579 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-04 14:38:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 303 transitions. [2025-03-04 14:38:26,580 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 303 transitions. Word has length 158 [2025-03-04 14:38:26,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:26,580 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 303 transitions. [2025-03-04 14:38:26,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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-04 14:38:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 303 transitions. [2025-03-04 14:38:26,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-04 14:38:26,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:26,581 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-04 14:38:26,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:26,782 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-04 14:38:26,782 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-04 14:38:26,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:26,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1948231109, now seen corresponding path program 1 times [2025-03-04 14:38:26,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:26,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759437599] [2025-03-04 14:38:26,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:26,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:26,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 14:38:26,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 14:38:26,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:26,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:27,303 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-04 14:38:27,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:27,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759437599] [2025-03-04 14:38:27,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759437599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:27,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:27,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:38:27,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844721684] [2025-03-04 14:38:27,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:27,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:38:27,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:27,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:38:27,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:27,305 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-04 14:38:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:27,341 INFO L93 Difference]: Finished difference Result 330 states and 375 transitions. [2025-03-04 14:38:27,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:38:27,341 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-04 14:38:27,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:27,342 INFO L225 Difference]: With dead ends: 330 [2025-03-04 14:38:27,342 INFO L226 Difference]: Without dead ends: 279 [2025-03-04 14:38:27,342 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-04 14:38:27,343 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-04 14:38:27,343 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-04 14:38:27,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-03-04 14:38:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2025-03-04 14:38:27,352 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-04 14:38:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 306 transitions. [2025-03-04 14:38:27,353 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 306 transitions. Word has length 165 [2025-03-04 14:38:27,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:27,353 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 306 transitions. [2025-03-04 14:38:27,354 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-04 14:38:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 306 transitions. [2025-03-04 14:38:27,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 14:38:27,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:27,355 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-04 14:38:27,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 14:38:27,355 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-04 14:38:27,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:27,355 INFO L85 PathProgramCache]: Analyzing trace with hash -115026884, now seen corresponding path program 1 times [2025-03-04 14:38:27,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:27,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133080739] [2025-03-04 14:38:27,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:27,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:27,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 14:38:27,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 14:38:27,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:27,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:28,518 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-04 14:38:28,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:38:28,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133080739] [2025-03-04 14:38:28,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133080739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:28,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853076929] [2025-03-04 14:38:28,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:28,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:28,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:28,520 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-04 14:38:28,522 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-04 14:38:28,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 14:38:29,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 14:38:29,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:29,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:29,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 1993 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 14:38:29,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:29,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 14:38:29,192 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 7 treesize of output 3 [2025-03-04 14:38:29,198 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-04 14:38:29,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:29,251 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 14 [2025-03-04 14:38:29,253 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 16 treesize of output 12 [2025-03-04 14:38:29,285 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-04 14:38:29,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853076929] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:29,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:38:29,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 16 [2025-03-04 14:38:29,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767513235] [2025-03-04 14:38:29,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:29,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 14:38:29,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:38:29,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 14:38:29,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-04 14:38:29,287 INFO L87 Difference]: Start difference. First operand 277 states and 306 transitions. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 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-04 14:38:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:29,437 INFO L93 Difference]: Finished difference Result 342 states and 392 transitions. [2025-03-04 14:38:29,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 14:38:29,438 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 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-04 14:38:29,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:29,439 INFO L225 Difference]: With dead ends: 342 [2025-03-04 14:38:29,439 INFO L226 Difference]: Without dead ends: 297 [2025-03-04 14:38:29,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-04 14:38:29,441 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 30 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:29,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 916 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:38:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-03-04 14:38:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 281. [2025-03-04 14:38:29,451 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-04 14:38:29,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 312 transitions. [2025-03-04 14:38:29,452 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 312 transitions. Word has length 166 [2025-03-04 14:38:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:29,452 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 312 transitions. [2025-03-04 14:38:29,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 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-04 14:38:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 312 transitions. [2025-03-04 14:38:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 14:38:29,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:29,454 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-04 14:38:29,465 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-04 14:38:29,654 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-04 14:38:29,654 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-04 14:38:29,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:29,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1258314400, now seen corresponding path program 1 times [2025-03-04 14:38:29,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:38:29,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541792352] [2025-03-04 14:38:29,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:29,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:38:29,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 14:38:29,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 14:38:29,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:29,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 14:38:29,977 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 14:38:29,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 14:38:30,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 14:38:30,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:30,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 14:38:30,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 14:38:30,294 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 14:38:30,294 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2025-03-04 14:38:30,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2025-03-04 14:38:30,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2025-03-04 14:38:30,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2025-03-04 14:38:30,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2025-03-04 14:38:30,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2025-03-04 14:38:30,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2025-03-04 14:38:30,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2025-03-04 14:38:30,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2025-03-04 14:38:30,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2025-03-04 14:38:30,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2025-03-04 14:38:30,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2025-03-04 14:38:30,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2025-03-04 14:38:30,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2025-03-04 14:38:30,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2025-03-04 14:38:30,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2025-03-04 14:38:30,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2025-03-04 14:38:30,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2025-03-04 14:38:30,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2025-03-04 14:38:30,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2025-03-04 14:38:30,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2025-03-04 14:38:30,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2025-03-04 14:38:30,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2025-03-04 14:38:30,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2025-03-04 14:38:30,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 14:38:30,301 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-04 14:38:30,398 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 14:38:30,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 02:38:30 BoogieIcfgContainer [2025-03-04 14:38:30,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 14:38:30,402 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 14:38:30,402 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 14:38:30,403 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 14:38:30,403 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:38:09" (3/4) ... [2025-03-04 14:38:30,405 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 14:38:30,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 14:38:30,406 INFO L158 Benchmark]: Toolchain (without parser) took 22841.63ms. Allocated memory was 167.8MB in the beginning and 704.6MB in the end (delta: 536.9MB). Free memory was 119.3MB in the beginning and 533.3MB in the end (delta: -414.0MB). Peak memory consumption was 124.5MB. Max. memory is 16.1GB. [2025-03-04 14:38:30,406 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:38:30,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.02ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 72.8MB in the end (delta: 46.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 14:38:30,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.84ms. Allocated memory is still 167.8MB. Free memory was 72.8MB in the beginning and 66.2MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:38:30,406 INFO L158 Benchmark]: Boogie Preprocessor took 92.01ms. Allocated memory is still 167.8MB. Free memory was 66.2MB in the beginning and 57.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 14:38:30,406 INFO L158 Benchmark]: IcfgBuilder took 746.36ms. Allocated memory is still 167.8MB. Free memory was 57.4MB in the beginning and 71.2MB in the end (delta: -13.8MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. [2025-03-04 14:38:30,407 INFO L158 Benchmark]: TraceAbstraction took 21318.84ms. Allocated memory was 167.8MB in the beginning and 704.6MB in the end (delta: 536.9MB). Free memory was 71.2MB in the beginning and 533.5MB in the end (delta: -462.3MB). Peak memory consumption was 364.8MB. Max. memory is 16.1GB. [2025-03-04 14:38:30,407 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 704.6MB. Free memory was 533.5MB in the beginning and 533.3MB in the end (delta: 144.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 14:38:30,407 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.13ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 611.02ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 72.8MB in the end (delta: 46.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.84ms. Allocated memory is still 167.8MB. Free memory was 72.8MB in the beginning and 66.2MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.01ms. Allocated memory is still 167.8MB. Free memory was 66.2MB in the beginning and 57.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 746.36ms. Allocated memory is still 167.8MB. Free memory was 57.4MB in the beginning and 71.2MB in the end (delta: -13.8MB). Peak memory consumption was 36.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21318.84ms. Allocated memory was 167.8MB in the beginning and 704.6MB in the end (delta: 536.9MB). Free memory was 71.2MB in the beginning and 533.5MB in the end (delta: -462.3MB). Peak memory consumption was 364.8MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 704.6MB. Free memory was 533.5MB in the beginning and 533.3MB in the end (delta: 144.0kB). There was no memory consumed. 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, 24 error locations. Started 1 CEGAR loops. OverallTime: 21.2s, OverallIterations: 31, TraceHistogramMax: 20, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 788 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 780 mSDsluCounter, 9719 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6551 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1058 IncrementalHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 3168 mSDtfsCounter, 1058 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2340 GetRequests, 2196 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=30, InterpolantAutomatonStates: 170, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 41 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 3661 NumberOfCodeBlocks, 3433 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 4343 ConstructedInterpolants, 0 QuantifiedInterpolants, 10547 SizeOfPredicates, 23 NumberOfNonLiveVariables, 22324 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 56 InterpolantComputations, 20 PerfectInterpolantSequences, 13138/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-04 14:38:30,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-?-798a7b3-m [2025-03-04 14:38:32,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:38:32,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2025-03-04 14:38:32,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:38:32,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:38:32,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2025-03-04 14:38:32,465 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:38:32,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:38:32,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:38:32,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:38:32,467 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:38:32,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:38:32,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:38:32,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:38:32,468 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:38:32,468 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:38:32,468 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:38:32,468 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:38:32,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:38:32,469 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:38:32,469 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:38:32,469 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:38:32,469 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 14:38:32,469 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 14:38:32,469 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:38:32,469 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 14:38:32,469 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:38:32,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:38:32,469 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:38:32,469 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:38:32,470 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:38:32,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:38:32,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:38:32,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:38:32,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:38:32,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:38:32,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:38:32,470 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:38:32,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:38:32,470 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 14:38:32,470 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 14:38:32,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:38:32,471 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:38:32,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:38:32,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:38:32,471 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-04 14:38:32,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:38:32,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:38:32,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:38:32,722 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:38:32,722 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:38:32,723 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-04 14:38:33,841 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79dfcc877/f48b6eddd7544169a80400e9793ad27f/FLAGc0b9e4e99 [2025-03-04 14:38:34,109 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:38:34,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-2.i [2025-03-04 14:38:34,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79dfcc877/f48b6eddd7544169a80400e9793ad27f/FLAGc0b9e4e99 [2025-03-04 14:38:34,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79dfcc877/f48b6eddd7544169a80400e9793ad27f [2025-03-04 14:38:34,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:38:34,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:38:34,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:38:34,412 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:38:34,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:38:34,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:38:34" (1/1) ... [2025-03-04 14:38:34,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ee400ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:34, skipping insertion in model container [2025-03-04 14:38:34,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:38:34" (1/1) ... [2025-03-04 14:38:34,443 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:38:34,793 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-04 14:38:34,807 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-04 14:38:34,809 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-04 14:38:34,812 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-04 14:38:34,814 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-04 14:38:34,819 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-04 14:38:34,820 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-04 14:38:34,820 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-04 14:38:34,821 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-04 14:38:34,823 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-04 14:38:34,835 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-04 14:38:34,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:38:34,861 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:38:34,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:38:35,051 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:38:35,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35 WrapperNode [2025-03-04 14:38:35,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:38:35,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:38:35,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:38:35,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:38:35,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35" (1/1) ... [2025-03-04 14:38:35,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35" (1/1) ... [2025-03-04 14:38:35,112 INFO L138 Inliner]: procedures = 353, calls = 463, calls flagged for inlining = 11, calls inlined = 10, statements flattened = 717 [2025-03-04 14:38:35,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:38:35,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:38:35,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:38:35,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:38:35,123 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35" (1/1) ... [2025-03-04 14:38:35,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35" (1/1) ... [2025-03-04 14:38:35,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35" (1/1) ... [2025-03-04 14:38:35,183 INFO L175 MemorySlicer]: Split 412 memory accesses to 14 slices as follows [2, 2, 3, 3, 3, 4, 4, 4, 12, 3, 3, 355, 2, 12]. 86 percent of accesses are in the largest equivalence class. The 379 initializations are split as follows [2, 0, 3, 3, 3, 3, 3, 3, 0, 3, 1, 355, 0, 0]. The 11 writes are split as follows [0, 2, 0, 0, 0, 0, 0, 0, 5, 0, 1, 0, 1, 2]. [2025-03-04 14:38:35,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35" (1/1) ... [2025-03-04 14:38:35,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35" (1/1) ... [2025-03-04 14:38:35,224 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35" (1/1) ... [2025-03-04 14:38:35,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35" (1/1) ... [2025-03-04 14:38:35,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35" (1/1) ... [2025-03-04 14:38:35,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35" (1/1) ... [2025-03-04 14:38:35,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:38:35,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:38:35,269 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:38:35,269 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:38:35,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35" (1/1) ... [2025-03-04 14:38:35,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:38:35,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:35,300 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-04 14:38:35,305 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-04 14:38:35,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 14:38:35,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 14:38:35,325 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:38:35,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:38:35,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 14:38:35,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 14:38:35,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 14:38:35,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 14:38:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 14:38:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 14:38:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 14:38:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 14:38:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 14:38:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-04 14:38:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-03-04 14:38:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:38:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 14:38:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 14:38:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 14:38:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 14:38:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 14:38:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 14:38:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-04 14:38:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-04 14:38:35,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-04 14:38:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-04 14:38:35,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 14:38:35,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 14:38:35,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:38:35,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:38:35,695 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:38:35,697 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:38:36,357 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2025-03-04 14:38:36,357 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:38:36,367 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:38:36,367 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 14:38:36,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:38:36 BoogieIcfgContainer [2025-03-04 14:38:36,368 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:38:36,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:38:36,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:38:36,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:38:36,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:38:34" (1/3) ... [2025-03-04 14:38:36,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47513de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:38:36, skipping insertion in model container [2025-03-04 14:38:36,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:38:35" (2/3) ... [2025-03-04 14:38:36,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47513de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:38:36, skipping insertion in model container [2025-03-04 14:38:36,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:38:36" (3/3) ... [2025-03-04 14:38:36,378 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-2.i [2025-03-04 14:38:36,389 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:38:36,390 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-04 14:38:36,429 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:38:36,437 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;@7d6c0ac0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:38:36,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-04 14:38:36,440 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-04 14:38:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 14:38:36,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:36,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 14:38:36,444 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-04 14:38:36,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:36,448 INFO L85 PathProgramCache]: Analyzing trace with hash 6309695, now seen corresponding path program 1 times [2025-03-04 14:38:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:36,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483150075] [2025-03-04 14:38:36,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:36,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:36,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:36,459 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-04 14:38:36,461 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-04 14:38:36,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 14:38:37,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 14:38:37,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:37,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:37,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 14:38:37,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:37,126 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-04 14:38:37,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:37,127 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:37,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483150075] [2025-03-04 14:38:37,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483150075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:37,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:37,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 14:38:37,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472020898] [2025-03-04 14:38:37,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:37,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 14:38:37,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:37,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 14:38:37,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 14:38:37,145 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-04 14:38:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:37,167 INFO L93 Difference]: Finished difference Result 211 states and 300 transitions. [2025-03-04 14:38:37,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 14:38:37,168 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-04 14:38:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:37,174 INFO L225 Difference]: With dead ends: 211 [2025-03-04 14:38:37,174 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 14:38:37,176 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-04 14:38:37,178 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-04 14:38:37,178 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-04 14:38:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 14:38:37,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 14:38:37,205 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-04 14:38:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2025-03-04 14:38:37,208 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 4 [2025-03-04 14:38:37,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:37,208 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2025-03-04 14:38:37,208 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-04 14:38:37,208 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2025-03-04 14:38:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 14:38:37,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:37,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 14:38:37,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 14:38:37,409 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-04 14:38:37,410 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-04 14:38:37,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash 195600684, now seen corresponding path program 1 times [2025-03-04 14:38:37,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:37,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1974374698] [2025-03-04 14:38:37,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:37,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:37,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:37,413 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-04 14:38:37,415 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-04 14:38:37,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 14:38:38,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 14:38:38,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:38,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:38,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:38,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:38,101 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-04 14:38:38,101 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:38,101 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:38,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974374698] [2025-03-04 14:38:38,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974374698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:38,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:38,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:38,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240918881] [2025-03-04 14:38:38,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:38,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:38,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:38,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:38,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:38,103 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-04 14:38:38,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:38,144 INFO L93 Difference]: Finished difference Result 192 states and 254 transitions. [2025-03-04 14:38:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:38,145 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-04 14:38:38,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:38,146 INFO L225 Difference]: With dead ends: 192 [2025-03-04 14:38:38,147 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 14:38:38,148 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-04 14:38:38,148 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-04 14:38:38,149 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-04 14:38:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 14:38:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 14:38:38,157 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-04 14:38:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2025-03-04 14:38:38,158 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 5 [2025-03-04 14:38:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:38,158 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2025-03-04 14:38:38,158 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-04 14:38:38,158 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2025-03-04 14:38:38,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 14:38:38,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:38,158 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-04 14:38:38,191 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-04 14:38:38,364 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-04 14:38:38,365 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-04 14:38:38,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:38,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1130501695, now seen corresponding path program 1 times [2025-03-04 14:38:38,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:38,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218908439] [2025-03-04 14:38:38,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:38,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:38,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:38,369 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-04 14:38:38,370 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-04 14:38:38,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 14:38:38,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 14:38:38,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:38,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:38,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:38,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:39,016 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-04 14:38:39,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:39,052 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-04 14:38:39,052 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:39,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218908439] [2025-03-04 14:38:39,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218908439] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:39,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:38:39,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:38:39,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742570649] [2025-03-04 14:38:39,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:39,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:39,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:39,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:39,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:39,053 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-04 14:38:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:39,128 INFO L93 Difference]: Finished difference Result 195 states and 259 transitions. [2025-03-04 14:38:39,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:39,129 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-04 14:38:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:39,129 INFO L225 Difference]: With dead ends: 195 [2025-03-04 14:38:39,129 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 14:38:39,130 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-04 14:38:39,130 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:39,130 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.1s Time] [2025-03-04 14:38:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 14:38:39,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2025-03-04 14:38:39,136 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-04 14:38:39,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2025-03-04 14:38:39,137 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 8 [2025-03-04 14:38:39,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:39,137 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2025-03-04 14:38:39,137 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-04 14:38:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2025-03-04 14:38:39,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 14:38:39,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:39,138 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:38:39,166 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-04 14:38:39,338 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-04 14:38:39,339 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-04 14:38:39,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:39,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2016733370, now seen corresponding path program 1 times [2025-03-04 14:38:39,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:39,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692371786] [2025-03-04 14:38:39,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:39,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:39,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:39,342 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-04 14:38:39,344 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-04 14:38:39,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 14:38:39,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 14:38:39,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:39,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:39,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:38:39,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:39,975 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-04 14:38:39,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:39,976 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:39,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692371786] [2025-03-04 14:38:39,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692371786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:39,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:39,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:38:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747838737] [2025-03-04 14:38:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:39,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:38:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:39,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:38:39,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:39,977 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-04 14:38:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:40,241 INFO L93 Difference]: Finished difference Result 100 states and 131 transitions. [2025-03-04 14:38:40,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:38:40,242 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-04 14:38:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:40,243 INFO L225 Difference]: With dead ends: 100 [2025-03-04 14:38:40,243 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 14:38:40,243 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-04 14:38:40,244 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 111 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:40,244 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.3s Time] [2025-03-04 14:38:40,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 14:38:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 14:38:40,253 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-04 14:38:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2025-03-04 14:38:40,253 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 16 [2025-03-04 14:38:40,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:40,254 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2025-03-04 14:38:40,254 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-04 14:38:40,254 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2025-03-04 14:38:40,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:38:40,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:40,254 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-04 14:38:40,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 14:38:40,455 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-04 14:38:40,455 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-04 14:38:40,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2098114320, now seen corresponding path program 1 times [2025-03-04 14:38:40,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:40,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1608286139] [2025-03-04 14:38:40,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:40,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:40,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:40,458 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-04 14:38:40,459 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-04 14:38:40,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:38:41,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:38:41,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:41,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:41,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:41,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:41,099 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-04 14:38:41,100 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:41,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:41,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608286139] [2025-03-04 14:38:41,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608286139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:41,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:41,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:41,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533558249] [2025-03-04 14:38:41,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:41,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:41,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:41,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:41,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:41,101 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-04 14:38:41,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:41,205 INFO L93 Difference]: Finished difference Result 106 states and 139 transitions. [2025-03-04 14:38:41,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:41,207 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-04 14:38:41,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:41,207 INFO L225 Difference]: With dead ends: 106 [2025-03-04 14:38:41,207 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 14:38:41,208 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-04 14:38:41,208 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-04 14:38:41,208 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-04 14:38:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 14:38:41,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-03-04 14:38:41,215 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-04 14:38:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2025-03-04 14:38:41,216 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 22 [2025-03-04 14:38:41,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:41,217 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2025-03-04 14:38:41,217 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-04 14:38:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2025-03-04 14:38:41,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 14:38:41,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:41,219 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-04 14:38:41,246 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-04 14:38:41,419 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-04 14:38:41,420 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-04 14:38:41,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:41,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2098119285, now seen corresponding path program 1 times [2025-03-04 14:38:41,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:41,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1988560272] [2025-03-04 14:38:41,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:41,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:41,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:41,422 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-04 14:38:41,423 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-04 14:38:41,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 14:38:41,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 14:38:41,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:41,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:42,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:42,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:42,064 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-04 14:38:42,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:42,064 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:42,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988560272] [2025-03-04 14:38:42,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988560272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:42,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:42,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:42,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192524695] [2025-03-04 14:38:42,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:42,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:42,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:42,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:42,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:42,065 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-04 14:38:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:42,091 INFO L93 Difference]: Finished difference Result 196 states and 263 transitions. [2025-03-04 14:38:42,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:42,092 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-04 14:38:42,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:42,092 INFO L225 Difference]: With dead ends: 196 [2025-03-04 14:38:42,092 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 14:38:42,093 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-04 14:38:42,093 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-04 14:38:42,093 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-04 14:38:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 14:38:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-04 14:38:42,098 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-04 14:38:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 144 transitions. [2025-03-04 14:38:42,098 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 144 transitions. Word has length 22 [2025-03-04 14:38:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:42,099 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 144 transitions. [2025-03-04 14:38:42,099 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-04 14:38:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 144 transitions. [2025-03-04 14:38:42,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 14:38:42,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:42,099 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-04 14:38:42,128 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-04 14:38:42,299 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-04 14:38:42,300 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-04 14:38:42,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:42,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1136443579, now seen corresponding path program 1 times [2025-03-04 14:38:42,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:42,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [573661095] [2025-03-04 14:38:42,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:42,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:42,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:42,302 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-04 14:38:42,303 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-04 14:38:42,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 14:38:42,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 14:38:42,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:42,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:42,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:42,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:42,904 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-04 14:38:42,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:42,904 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:42,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573661095] [2025-03-04 14:38:42,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573661095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:42,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:42,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 14:38:42,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583077657] [2025-03-04 14:38:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:42,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:42,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:42,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:42,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:42,905 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-04 14:38:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:42,923 INFO L93 Difference]: Finished difference Result 114 states and 148 transitions. [2025-03-04 14:38:42,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:42,924 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-04 14:38:42,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:42,925 INFO L225 Difference]: With dead ends: 114 [2025-03-04 14:38:42,925 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 14:38:42,925 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-04 14:38:42,925 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-04 14:38:42,925 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-04 14:38:42,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 14:38:42,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-04 14:38:42,929 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-04 14:38:42,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 147 transitions. [2025-03-04 14:38:42,930 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 147 transitions. Word has length 25 [2025-03-04 14:38:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:42,930 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 147 transitions. [2025-03-04 14:38:42,930 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-04 14:38:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 147 transitions. [2025-03-04 14:38:42,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 14:38:42,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:42,931 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-04 14:38:42,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 14:38:43,131 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-04 14:38:43,131 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-04 14:38:43,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:43,132 INFO L85 PathProgramCache]: Analyzing trace with hash 412686792, now seen corresponding path program 1 times [2025-03-04 14:38:43,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:43,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1480514888] [2025-03-04 14:38:43,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:43,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:43,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:43,134 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-04 14:38:43,135 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-04 14:38:43,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 14:38:43,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 14:38:43,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:43,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:43,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:43,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:43,835 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-04 14:38:43,835 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:43,867 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-04 14:38:43,867 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:43,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480514888] [2025-03-04 14:38:43,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480514888] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:43,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:38:43,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:38:43,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876146226] [2025-03-04 14:38:43,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:43,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:43,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:43,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:43,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:43,868 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-04 14:38:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:43,953 INFO L93 Difference]: Finished difference Result 212 states and 282 transitions. [2025-03-04 14:38:43,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:43,955 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-04 14:38:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:43,956 INFO L225 Difference]: With dead ends: 212 [2025-03-04 14:38:43,956 INFO L226 Difference]: Without dead ends: 120 [2025-03-04 14:38:43,956 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-04 14:38:43,957 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-04 14:38:43,957 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-04 14:38:43,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-04 14:38:43,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2025-03-04 14:38:43,964 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-04 14:38:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 147 transitions. [2025-03-04 14:38:43,965 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 147 transitions. Word has length 25 [2025-03-04 14:38:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:43,965 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 147 transitions. [2025-03-04 14:38:43,965 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-04 14:38:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 147 transitions. [2025-03-04 14:38:43,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 14:38:43,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:43,969 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-04 14:38:43,997 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-04 14:38:44,169 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-04 14:38:44,169 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-04 14:38:44,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:44,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2023432423, now seen corresponding path program 1 times [2025-03-04 14:38:44,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:44,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [908622122] [2025-03-04 14:38:44,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:44,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:44,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:44,172 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-04 14:38:44,173 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-04 14:38:44,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 14:38:44,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 14:38:44,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:44,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:44,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:38:44,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:44,806 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-04 14:38:44,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:44,807 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:44,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908622122] [2025-03-04 14:38:44,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908622122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:44,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:44,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:38:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861791493] [2025-03-04 14:38:44,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:44,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:44,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:44,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:44,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:44,808 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-04 14:38:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:45,069 INFO L93 Difference]: Finished difference Result 193 states and 253 transitions. [2025-03-04 14:38:45,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:45,070 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-04 14:38:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:45,070 INFO L225 Difference]: With dead ends: 193 [2025-03-04 14:38:45,070 INFO L226 Difference]: Without dead ends: 114 [2025-03-04 14:38:45,071 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-04 14:38:45,071 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:45,071 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.3s Time] [2025-03-04 14:38:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-04 14:38:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-04 14:38:45,074 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-04 14:38:45,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 146 transitions. [2025-03-04 14:38:45,075 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 146 transitions. Word has length 27 [2025-03-04 14:38:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:45,075 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 146 transitions. [2025-03-04 14:38:45,075 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-04 14:38:45,075 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 146 transitions. [2025-03-04 14:38:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 14:38:45,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:45,076 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-04 14:38:45,106 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-04 14:38:45,276 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-04 14:38:45,276 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-04 14:38:45,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1242656127, now seen corresponding path program 1 times [2025-03-04 14:38:45,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:45,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2146119447] [2025-03-04 14:38:45,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:45,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:45,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:45,279 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-04 14:38:45,280 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-04 14:38:45,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 14:38:45,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 14:38:45,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:45,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:45,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:38:45,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:45,999 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-04 14:38:45,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:46,050 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-04 14:38:46,050 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:46,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146119447] [2025-03-04 14:38:46,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146119447] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:46,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:46,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-04 14:38:46,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006190050] [2025-03-04 14:38:46,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:46,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:38:46,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:46,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:38:46,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:46,051 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-04 14:38:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:46,212 INFO L93 Difference]: Finished difference Result 116 states and 149 transitions. [2025-03-04 14:38:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:38:46,213 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-04 14:38:46,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:46,213 INFO L225 Difference]: With dead ends: 116 [2025-03-04 14:38:46,213 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 14:38:46,214 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-04 14:38:46,214 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-04 14:38:46,214 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-04 14:38:46,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 14:38:46,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2025-03-04 14:38:46,217 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-04 14:38:46,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 145 transitions. [2025-03-04 14:38:46,218 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 145 transitions. Word has length 37 [2025-03-04 14:38:46,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:46,218 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 145 transitions. [2025-03-04 14:38:46,218 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-04 14:38:46,218 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 145 transitions. [2025-03-04 14:38:46,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 14:38:46,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:46,219 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-04 14:38:46,248 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-04 14:38:46,419 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-04 14:38:46,420 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-04 14:38:46,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:46,420 INFO L85 PathProgramCache]: Analyzing trace with hash -129225154, now seen corresponding path program 1 times [2025-03-04 14:38:46,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:46,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [417690672] [2025-03-04 14:38:46,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:46,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:46,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:46,423 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-04 14:38:46,423 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-04 14:38:46,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 14:38:46,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 14:38:46,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:46,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:47,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:47,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:47,086 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-04 14:38:47,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:47,113 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-04 14:38:47,113 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:47,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417690672] [2025-03-04 14:38:47,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417690672] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:47,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:38:47,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:38:47,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779290580] [2025-03-04 14:38:47,114 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:47,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:47,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:47,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:47,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:47,114 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-04 14:38:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:47,159 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2025-03-04 14:38:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:47,160 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-04 14:38:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:47,160 INFO L225 Difference]: With dead ends: 120 [2025-03-04 14:38:47,160 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 14:38:47,161 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-04 14:38:47,161 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-04 14:38:47,161 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-04 14:38:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 14:38:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-04 14:38:47,164 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-04 14:38:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 131 transitions. [2025-03-04 14:38:47,164 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 131 transitions. Word has length 38 [2025-03-04 14:38:47,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:47,164 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 131 transitions. [2025-03-04 14:38:47,164 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-04 14:38:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2025-03-04 14:38:47,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 14:38:47,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:47,165 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-04 14:38:47,194 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-04 14:38:47,365 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-04 14:38:47,366 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-04 14:38:47,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:47,366 INFO L85 PathProgramCache]: Analyzing trace with hash 590201800, now seen corresponding path program 1 times [2025-03-04 14:38:47,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:47,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137261193] [2025-03-04 14:38:47,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:47,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:47,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:47,368 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-04 14:38:47,370 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-04 14:38:47,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 14:38:48,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 14:38:48,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:48,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:48,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:48,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:48,129 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-04 14:38:48,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:48,173 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-04 14:38:48,174 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:48,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137261193] [2025-03-04 14:38:48,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137261193] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:48,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:38:48,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 14:38:48,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53017496] [2025-03-04 14:38:48,174 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:48,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:38:48,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:48,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:38:48,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:38:48,175 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-04 14:38:48,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:48,509 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2025-03-04 14:38:48,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:48,510 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-04 14:38:48,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:48,511 INFO L225 Difference]: With dead ends: 124 [2025-03-04 14:38:48,511 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 14:38:48,511 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-04 14:38:48,512 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:48,512 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.3s Time] [2025-03-04 14:38:48,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 14:38:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 93. [2025-03-04 14:38:48,516 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-04 14:38:48,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 120 transitions. [2025-03-04 14:38:48,517 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 120 transitions. Word has length 38 [2025-03-04 14:38:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:48,517 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 120 transitions. [2025-03-04 14:38:48,517 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-04 14:38:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 120 transitions. [2025-03-04 14:38:48,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 14:38:48,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:48,518 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-04 14:38:48,548 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-04 14:38:48,718 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-04 14:38:48,719 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-04 14:38:48,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:48,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1615895382, now seen corresponding path program 1 times [2025-03-04 14:38:48,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:48,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [344965077] [2025-03-04 14:38:48,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:48,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:48,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:48,725 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-04 14:38:48,726 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-04 14:38:48,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 14:38:49,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 14:38:49,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:49,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:49,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 14:38:49,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:49,347 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-04 14:38:49,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:49,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:49,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344965077] [2025-03-04 14:38:49,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344965077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:49,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:49,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:38:49,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986383096] [2025-03-04 14:38:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:49,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:49,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:49,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:49,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:38:49,349 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-04 14:38:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:49,355 INFO L93 Difference]: Finished difference Result 140 states and 183 transitions. [2025-03-04 14:38:49,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:49,356 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-04 14:38:49,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:49,356 INFO L225 Difference]: With dead ends: 140 [2025-03-04 14:38:49,356 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 14:38:49,357 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-04 14:38:49,357 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-04 14:38:49,357 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-04 14:38:49,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 14:38:49,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-04 14:38:49,360 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-04 14:38:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2025-03-04 14:38:49,361 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 40 [2025-03-04 14:38:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:49,361 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2025-03-04 14:38:49,361 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-04 14:38:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2025-03-04 14:38:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 14:38:49,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:49,362 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-04 14:38:49,385 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-04 14:38:49,562 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-04 14:38:49,563 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-04 14:38:49,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1272552508, now seen corresponding path program 1 times [2025-03-04 14:38:49,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:49,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [544055597] [2025-03-04 14:38:49,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:49,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:49,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:49,566 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-04 14:38:49,566 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-04 14:38:49,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:38:50,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:38:50,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:50,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:50,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:38:50,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:50,249 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-04 14:38:50,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:50,249 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544055597] [2025-03-04 14:38:50,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544055597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:50,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:50,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 14:38:50,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611835062] [2025-03-04 14:38:50,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:50,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 14:38:50,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:50,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 14:38:50,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 14:38:50,250 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-04 14:38:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:50,284 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2025-03-04 14:38:50,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 14:38:50,284 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-04 14:38:50,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:50,285 INFO L225 Difference]: With dead ends: 103 [2025-03-04 14:38:50,285 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 14:38:50,285 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-04 14:38:50,286 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-04 14:38:50,286 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-04 14:38:50,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 14:38:50,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2025-03-04 14:38:50,289 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-04 14:38:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2025-03-04 14:38:50,290 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 59 [2025-03-04 14:38:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:50,290 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-03-04 14:38:50,290 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-04 14:38:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2025-03-04 14:38:50,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 14:38:50,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:50,291 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-04 14:38:50,316 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-04 14:38:50,491 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-04 14:38:50,491 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-04 14:38:50,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:50,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1243923357, now seen corresponding path program 1 times [2025-03-04 14:38:50,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:50,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [346597720] [2025-03-04 14:38:50,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:50,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:50,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:50,494 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-04 14:38:50,495 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-04 14:38:50,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 14:38:51,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 14:38:51,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:51,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:51,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 14:38:51,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:51,193 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-04 14:38:51,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:38:51,193 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:51,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346597720] [2025-03-04 14:38:51,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346597720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:38:51,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:38:51,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:38:51,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129245074] [2025-03-04 14:38:51,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:51,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:38:51,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:51,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:38:51,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:38:51,194 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-04 14:38:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:51,218 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2025-03-04 14:38:51,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:38:51,218 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-04 14:38:51,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:51,219 INFO L225 Difference]: With dead ends: 93 [2025-03-04 14:38:51,219 INFO L226 Difference]: Without dead ends: 91 [2025-03-04 14:38:51,219 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-04 14:38:51,219 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-04 14:38:51,220 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-04 14:38:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-04 14:38:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-04 14:38:51,222 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-04 14:38:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2025-03-04 14:38:51,223 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 59 [2025-03-04 14:38:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:51,223 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2025-03-04 14:38:51,223 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-04 14:38:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2025-03-04 14:38:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-04 14:38:51,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:51,224 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-04 14:38:51,253 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-04 14:38:51,424 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-04 14:38:51,425 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-04 14:38:51,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:51,425 INFO L85 PathProgramCache]: Analyzing trace with hash -285733404, now seen corresponding path program 1 times [2025-03-04 14:38:51,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:51,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [60918888] [2025-03-04 14:38:51,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:51,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:51,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:51,428 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-04 14:38:51,428 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-04 14:38:51,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 14:38:52,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 14:38:52,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:52,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:52,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:38:52,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:52,260 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-04 14:38:52,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:52,284 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-04 14:38:52,284 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:52,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60918888] [2025-03-04 14:38:52,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60918888] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 14:38:52,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:38:52,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 14:38:52,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929793226] [2025-03-04 14:38:52,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:38:52,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:38:52,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:52,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:38:52,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:38:52,285 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-04 14:38:52,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:52,307 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2025-03-04 14:38:52,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:38:52,308 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-04 14:38:52,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:52,309 INFO L225 Difference]: With dead ends: 91 [2025-03-04 14:38:52,309 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 14:38:52,309 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-04 14:38:52,310 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-04 14:38:52,310 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-04 14:38:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 14:38:52,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-04 14:38:52,314 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-04 14:38:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2025-03-04 14:38:52,315 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 75 [2025-03-04 14:38:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:52,315 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2025-03-04 14:38:52,315 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-04 14:38:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2025-03-04 14:38:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-04 14:38:52,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:52,316 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-04 14:38:52,343 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-04 14:38:52,516 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-04 14:38:52,517 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-04 14:38:52,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:52,522 INFO L85 PathProgramCache]: Analyzing trace with hash -267800945, now seen corresponding path program 1 times [2025-03-04 14:38:52,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:52,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [54351493] [2025-03-04 14:38:52,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:38:52,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:52,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:52,524 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-04 14:38:52,525 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-04 14:38:52,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 14:38:53,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 14:38:53,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:38:53,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:53,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:38:53,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:53,333 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-04 14:38:53,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:53,376 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-04 14:38:53,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:53,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54351493] [2025-03-04 14:38:53,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54351493] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:53,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:38:53,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 14:38:53,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823766431] [2025-03-04 14:38:53,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:53,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 14:38:53,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:53,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 14:38:53,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:38:53,378 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-04 14:38:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:53,460 INFO L93 Difference]: Finished difference Result 183 states and 234 transitions. [2025-03-04 14:38:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 14:38:53,461 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-04 14:38:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:53,462 INFO L225 Difference]: With dead ends: 183 [2025-03-04 14:38:53,462 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 14:38:53,462 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-04 14:38:53,463 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-04 14:38:53,463 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-04 14:38:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 14:38:53,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-04 14:38:53,472 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-04 14:38:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2025-03-04 14:38:53,472 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 76 [2025-03-04 14:38:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:53,473 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2025-03-04 14:38:53,473 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-04 14:38:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2025-03-04 14:38:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 14:38:53,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:53,474 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-04 14:38:53,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 14:38:53,674 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-04 14:38:53,675 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-04 14:38:53,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:53,675 INFO L85 PathProgramCache]: Analyzing trace with hash -57579825, now seen corresponding path program 2 times [2025-03-04 14:38:53,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:53,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922057077] [2025-03-04 14:38:53,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:38:53,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:53,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:53,678 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-04 14:38:53,678 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-04 14:38:53,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-04 14:38:54,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 14:38:54,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:38:54,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:38:54,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 14:38:54,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:38:54,565 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-04 14:38:54,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:38:54,753 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-04 14:38:54,753 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 14:38:54,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922057077] [2025-03-04 14:38:54,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922057077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:38:54,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 14:38:54,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-04 14:38:54,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77323081] [2025-03-04 14:38:54,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 14:38:54,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 14:38:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 14:38:54,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 14:38:54,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:38:54,756 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-04 14:38:55,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:38:55,165 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2025-03-04 14:38:55,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:38:55,165 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-04 14:38:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:38:55,166 INFO L225 Difference]: With dead ends: 188 [2025-03-04 14:38:55,166 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 14:38:55,166 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-04 14:38:55,167 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.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:38:55,167 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.4s Time] [2025-03-04 14:38:55,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 14:38:55,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2025-03-04 14:38:55,171 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-04 14:38:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 137 transitions. [2025-03-04 14:38:55,171 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 137 transitions. Word has length 88 [2025-03-04 14:38:55,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:38:55,171 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 137 transitions. [2025-03-04 14:38:55,172 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-04 14:38:55,172 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 137 transitions. [2025-03-04 14:38:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 14:38:55,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:38:55,172 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-04 14:38:55,204 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-04 14:38:55,373 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-04 14:38:55,373 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-04 14:38:55,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:38:55,373 INFO L85 PathProgramCache]: Analyzing trace with hash 505561191, now seen corresponding path program 3 times [2025-03-04 14:38:55,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 14:38:55,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991554226] [2025-03-04 14:38:55,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 14:38:55,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:38:55,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:38:55,376 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-04 14:38:55,377 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-04 14:38:55,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 98 statements into 8 equivalence classes.