./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7e63083161b3199c06a87ea66924e1f63d6865962e6a830baf344139b270d928 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:30:41,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:30:41,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:30:41,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:30:41,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:30:41,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:30:41,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:30:41,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:30:41,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:30:41,730 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:30:41,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:30:41,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:30:41,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:30:41,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:30:41,732 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:30:41,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:30:41,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:30:41,732 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:30:41,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:30:41,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:30:41,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:30:41,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:30:41,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:30:41,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:30:41,734 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:30:41,734 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:30:41,734 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:30:41,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:30:41,734 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:30:41,734 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:30:41,734 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:30:41,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:30:41,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:30:41,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:30:41,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:30:41,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:30:41,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:30:41,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:30:41,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:30:41,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:30:41,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:30:41,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:30:41,735 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:30:41,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:30:41,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:30:41,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:30:41,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:30:41,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:30:41,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:30:41,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:30:41,736 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e63083161b3199c06a87ea66924e1f63d6865962e6a830baf344139b270d928 [2025-01-10 06:30:41,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:30:42,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:30:42,004 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:30:42,005 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:30:42,005 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:30:42,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i [2025-01-10 06:30:43,296 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/609429931/fed406050ffc4307a42d764550b6e886/FLAG9ca9783e1 [2025-01-10 06:30:43,616 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:30:43,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-1.i [2025-01-10 06:30:43,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/609429931/fed406050ffc4307a42d764550b6e886/FLAG9ca9783e1 [2025-01-10 06:30:43,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/609429931/fed406050ffc4307a42d764550b6e886 [2025-01-10 06:30:43,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:30:43,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:30:43,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:30:43,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:30:43,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:30:43,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:30:43" (1/1) ... [2025-01-10 06:30:43,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18a54a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:43, skipping insertion in model container [2025-01-10 06:30:43,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:30:43" (1/1) ... [2025-01-10 06:30:43,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:30:44,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:30:44,208 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:30:44,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:30:44,361 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:30:44,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44 WrapperNode [2025-01-10 06:30:44,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:30:44,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:30:44,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:30:44,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:30:44,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44" (1/1) ... [2025-01-10 06:30:44,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44" (1/1) ... [2025-01-10 06:30:44,451 INFO L138 Inliner]: procedures = 177, calls = 291, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1387 [2025-01-10 06:30:44,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:30:44,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:30:44,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:30:44,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:30:44,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44" (1/1) ... [2025-01-10 06:30:44,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44" (1/1) ... [2025-01-10 06:30:44,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44" (1/1) ... [2025-01-10 06:30:44,554 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2025-01-10 06:30:44,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44" (1/1) ... [2025-01-10 06:30:44,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44" (1/1) ... [2025-01-10 06:30:44,607 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44" (1/1) ... [2025-01-10 06:30:44,610 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44" (1/1) ... [2025-01-10 06:30:44,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44" (1/1) ... [2025-01-10 06:30:44,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44" (1/1) ... [2025-01-10 06:30:44,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44" (1/1) ... [2025-01-10 06:30:44,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:30:44,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:30:44,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:30:44,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:30:44,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44" (1/1) ... [2025-01-10 06:30:44,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:30:44,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:30:44,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:30:44,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:30:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-01-10 06:30:44,730 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-01-10 06:30:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:30:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:30:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:30:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 06:30:44,730 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 06:30:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:30:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:30:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:30:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-01-10 06:30:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-01-10 06:30:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-01-10 06:30:44,730 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-01-10 06:30:44,730 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-01-10 06:30:44,730 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-01-10 06:30:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2025-01-10 06:30:44,730 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2025-01-10 06:30:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:30:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:30:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-10 06:30:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-10 06:30:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-10 06:30:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:30:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-10 06:30:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-10 06:30:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-10 06:30:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:30:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:30:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:30:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:30:44,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:30:44,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:30:44,964 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:30:44,966 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:30:47,246 INFO L? ?]: Removed 339 outVars from TransFormulas that were not future-live. [2025-01-10 06:30:47,246 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:30:47,274 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:30:47,277 INFO L312 CfgBuilder]: Removed 31 assume(true) statements. [2025-01-10 06:30:47,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:30:47 BoogieIcfgContainer [2025-01-10 06:30:47,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:30:47,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:30:47,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:30:47,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:30:47,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:30:43" (1/3) ... [2025-01-10 06:30:47,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f36e306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:30:47, skipping insertion in model container [2025-01-10 06:30:47,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:30:44" (2/3) ... [2025-01-10 06:30:47,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f36e306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:30:47, skipping insertion in model container [2025-01-10 06:30:47,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:30:47" (3/3) ... [2025-01-10 06:30:47,286 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test8-1.i [2025-01-10 06:30:47,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:30:47,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_test8-1.i that has 7 procedures, 459 locations, 1 initial locations, 37 loop locations, and 8 error locations. [2025-01-10 06:30:47,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:30:47,377 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;@3c9aa093, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:30:47,377 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 06:30:47,384 INFO L276 IsEmpty]: Start isEmpty. Operand has 451 states, 416 states have (on average 1.625) internal successors, (676), 441 states have internal predecessors, (676), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-10 06:30:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:30:47,387 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:47,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:30:47,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:30:47,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash -322566998, now seen corresponding path program 1 times [2025-01-10 06:30:47,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:47,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517529806] [2025-01-10 06:30:47,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:47,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:47,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:30:47,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:30:47,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:47,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:47,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:30:47,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:47,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517529806] [2025-01-10 06:30:47,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517529806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:47,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:47,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:30:47,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633529836] [2025-01-10 06:30:47,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:47,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-10 06:30:47,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:47,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-10 06:30:47,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-10 06:30:47,588 INFO L87 Difference]: Start difference. First operand has 451 states, 416 states have (on average 1.625) internal successors, (676), 441 states have internal predecessors, (676), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-01-10 06:30:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:47,660 INFO L93 Difference]: Finished difference Result 898 states and 1454 transitions. [2025-01-10 06:30:47,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 06:30:47,662 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-01-10 06:30:47,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:47,672 INFO L225 Difference]: With dead ends: 898 [2025-01-10 06:30:47,672 INFO L226 Difference]: Without dead ends: 442 [2025-01-10 06:30:47,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-01-10 06:30:47,678 INFO L435 NwaCegarLoop]: 653 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, 653 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-01-10 06:30:47,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:30:47,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-10 06:30:47,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-01-10 06:30:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 411 states have (on average 1.4720194647201947) internal successors, (605), 433 states have internal predecessors, (605), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 06:30:47,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 645 transitions. [2025-01-10 06:30:47,748 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 645 transitions. Word has length 8 [2025-01-10 06:30:47,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:47,748 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 645 transitions. [2025-01-10 06:30:47,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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-01-10 06:30:47,748 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 645 transitions. [2025-01-10 06:30:47,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 06:30:47,749 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:47,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:30:47,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:30:47,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:30:47,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash -322565076, now seen corresponding path program 1 times [2025-01-10 06:30:47,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:47,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536472436] [2025-01-10 06:30:47,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:47,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:30:47,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:30:47,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:47,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 06:30:47,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31831573] [2025-01-10 06:30:47,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:47,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:30:47,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:30:47,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:30:47,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:30:47,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:30:47,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:30:47,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:47,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:47,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:30:47,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:30:48,012 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 11 treesize of output 7 [2025-01-10 06:30:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:30:48,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:30:48,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:48,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536472436] [2025-01-10 06:30:48,062 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 06:30:48,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31831573] [2025-01-10 06:30:48,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31831573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:48,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:48,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:30:48,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951418519] [2025-01-10 06:30:48,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:48,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:30:48,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:48,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:30:48,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:30:48,065 INFO L87 Difference]: Start difference. First operand 442 states and 645 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-01-10 06:30:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:48,219 INFO L93 Difference]: Finished difference Result 836 states and 1214 transitions. [2025-01-10 06:30:48,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:30:48,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-01-10 06:30:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:48,226 INFO L225 Difference]: With dead ends: 836 [2025-01-10 06:30:48,226 INFO L226 Difference]: Without dead ends: 834 [2025-01-10 06:30:48,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-01-10 06:30:48,228 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 551 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1859 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:48,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1859 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:30:48,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-01-10 06:30:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 449. [2025-01-10 06:30:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 418 states have (on average 1.4665071770334928) internal successors, (613), 440 states have internal predecessors, (613), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 06:30:48,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 653 transitions. [2025-01-10 06:30:48,274 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 653 transitions. Word has length 8 [2025-01-10 06:30:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:48,274 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 653 transitions. [2025-01-10 06:30:48,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 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-01-10 06:30:48,275 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 653 transitions. [2025-01-10 06:30:48,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-01-10 06:30:48,277 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:48,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 06:30:48,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:30:48,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:30:48,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:30:48,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:48,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1084262815, now seen corresponding path program 1 times [2025-01-10 06:30:48,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:48,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703989203] [2025-01-10 06:30:48,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:48,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:48,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-10 06:30:48,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-10 06:30:48,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:48,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:48,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:30:48,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:48,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703989203] [2025-01-10 06:30:48,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703989203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:48,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:48,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:30:48,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827263828] [2025-01-10 06:30:48,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:48,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:30:48,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:48,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:30:48,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:30:48,972 INFO L87 Difference]: Start difference. First operand 449 states and 653 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:30:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:49,102 INFO L93 Difference]: Finished difference Result 1064 states and 1556 transitions. [2025-01-10 06:30:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:30:49,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-01-10 06:30:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:49,109 INFO L225 Difference]: With dead ends: 1064 [2025-01-10 06:30:49,109 INFO L226 Difference]: Without dead ends: 833 [2025-01-10 06:30:49,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-10 06:30:49,113 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 553 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:49,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1864 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:30:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-01-10 06:30:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 449. [2025-01-10 06:30:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 418 states have (on average 1.4641148325358853) internal successors, (612), 440 states have internal predecessors, (612), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 06:30:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 652 transitions. [2025-01-10 06:30:49,137 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 652 transitions. Word has length 71 [2025-01-10 06:30:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:49,137 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 652 transitions. [2025-01-10 06:30:49,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:30:49,138 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 652 transitions. [2025-01-10 06:30:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-10 06:30:49,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:49,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 06:30:49,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:30:49,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:30:49,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:49,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2125468816, now seen corresponding path program 1 times [2025-01-10 06:30:49,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:49,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620709740] [2025-01-10 06:30:49,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:49,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:49,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 06:30:49,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 06:30:49,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:49,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:49,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:30:49,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:49,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620709740] [2025-01-10 06:30:49,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620709740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:49,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:49,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:30:49,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958201606] [2025-01-10 06:30:49,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:49,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:30:49,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:49,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:30:49,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:30:49,403 INFO L87 Difference]: Start difference. First operand 449 states and 652 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:30:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:49,497 INFO L93 Difference]: Finished difference Result 847 states and 1229 transitions. [2025-01-10 06:30:49,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:30:49,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-01-10 06:30:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:49,500 INFO L225 Difference]: With dead ends: 847 [2025-01-10 06:30:49,501 INFO L226 Difference]: Without dead ends: 407 [2025-01-10 06:30:49,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-10 06:30:49,503 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 36 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:49,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1609 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:30:49,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-01-10 06:30:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-01-10 06:30:49,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 376 states have (on average 1.422872340425532) internal successors, (535), 398 states have internal predecessors, (535), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 06:30:49,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 575 transitions. [2025-01-10 06:30:49,553 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 575 transitions. Word has length 83 [2025-01-10 06:30:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:49,553 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 575 transitions. [2025-01-10 06:30:49,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:30:49,553 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 575 transitions. [2025-01-10 06:30:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-10 06:30:49,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:49,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 06:30:49,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:30:49,556 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:30:49,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:49,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1140324100, now seen corresponding path program 1 times [2025-01-10 06:30:49,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:49,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800404988] [2025-01-10 06:30:49,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:49,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:49,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 06:30:49,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 06:30:49,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:49,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:30:49,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:49,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800404988] [2025-01-10 06:30:49,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800404988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:49,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:49,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:30:49,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691396151] [2025-01-10 06:30:49,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:49,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:30:49,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:49,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:30:49,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:30:49,733 INFO L87 Difference]: Start difference. First operand 407 states and 575 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:30:49,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:49,798 INFO L93 Difference]: Finished difference Result 799 states and 1135 transitions. [2025-01-10 06:30:49,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:30:49,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-01-10 06:30:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:49,802 INFO L225 Difference]: With dead ends: 799 [2025-01-10 06:30:49,802 INFO L226 Difference]: Without dead ends: 401 [2025-01-10 06:30:49,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-10 06:30:49,803 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 9 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:49,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1610 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:30:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-01-10 06:30:49,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-01-10 06:30:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 370 states have (on average 1.4189189189189189) internal successors, (525), 392 states have internal predecessors, (525), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-10 06:30:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 565 transitions. [2025-01-10 06:30:49,815 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 565 transitions. Word has length 83 [2025-01-10 06:30:49,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:49,816 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 565 transitions. [2025-01-10 06:30:49,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:30:49,817 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 565 transitions. [2025-01-10 06:30:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-10 06:30:49,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:49,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 06:30:49,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:30:49,818 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:30:49,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:49,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1180689668, now seen corresponding path program 1 times [2025-01-10 06:30:49,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:49,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350212144] [2025-01-10 06:30:49,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:49,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:49,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-10 06:30:49,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-10 06:30:49,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:49,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:50,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:30:50,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:50,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350212144] [2025-01-10 06:30:50,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350212144] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:50,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:50,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:30:50,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289282341] [2025-01-10 06:30:50,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:50,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:30:50,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:50,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:30:50,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:30:50,019 INFO L87 Difference]: Start difference. First operand 401 states and 565 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:30:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:50,128 INFO L93 Difference]: Finished difference Result 1037 states and 1471 transitions. [2025-01-10 06:30:50,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:30:50,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-01-10 06:30:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:50,133 INFO L225 Difference]: With dead ends: 1037 [2025-01-10 06:30:50,133 INFO L226 Difference]: Without dead ends: 645 [2025-01-10 06:30:50,134 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-01-10 06:30:50,136 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 292 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:50,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1284 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:30:50,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-01-10 06:30:50,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 642. [2025-01-10 06:30:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 610 states have (on average 1.4262295081967213) internal successors, (870), 632 states have internal predecessors, (870), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-10 06:30:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 912 transitions. [2025-01-10 06:30:50,161 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 912 transitions. Word has length 83 [2025-01-10 06:30:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:50,161 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 912 transitions. [2025-01-10 06:30:50,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:30:50,161 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 912 transitions. [2025-01-10 06:30:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-10 06:30:50,162 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:50,162 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 06:30:50,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:30:50,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:30:50,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:50,163 INFO L85 PathProgramCache]: Analyzing trace with hash -354030204, now seen corresponding path program 1 times [2025-01-10 06:30:50,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:50,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69643130] [2025-01-10 06:30:50,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:50,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:50,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-10 06:30:50,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-10 06:30:50,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:50,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:30:50,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:50,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69643130] [2025-01-10 06:30:50,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69643130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:50,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:50,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:30:50,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560207273] [2025-01-10 06:30:50,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:50,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:30:50,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:50,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:30:50,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:30:50,495 INFO L87 Difference]: Start difference. First operand 642 states and 912 transitions. Second operand has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:30:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:50,575 INFO L93 Difference]: Finished difference Result 743 states and 1062 transitions. [2025-01-10 06:30:50,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:30:50,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2025-01-10 06:30:50,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:50,582 INFO L225 Difference]: With dead ends: 743 [2025-01-10 06:30:50,582 INFO L226 Difference]: Without dead ends: 741 [2025-01-10 06:30:50,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-10 06:30:50,583 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 144 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:50,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1631 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 06:30:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-01-10 06:30:50,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 712. [2025-01-10 06:30:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 675 states have (on average 1.411851851851852) internal successors, (953), 697 states have internal predecessors, (953), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 10 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-10 06:30:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1003 transitions. [2025-01-10 06:30:50,611 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1003 transitions. Word has length 98 [2025-01-10 06:30:50,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:50,615 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1003 transitions. [2025-01-10 06:30:50,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 30.0) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 06:30:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1003 transitions. [2025-01-10 06:30:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-10 06:30:50,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:50,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 06:30:50,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:30:50,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:30:50,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:50,617 INFO L85 PathProgramCache]: Analyzing trace with hash -788481499, now seen corresponding path program 1 times [2025-01-10 06:30:50,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:50,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919331942] [2025-01-10 06:30:50,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:50,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:50,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-10 06:30:50,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-10 06:30:50,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:50,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:30:51,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:51,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919331942] [2025-01-10 06:30:51,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919331942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:51,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:30:51,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:30:51,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458898247] [2025-01-10 06:30:51,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:51,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:30:51,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:51,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:30:51,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:30:51,010 INFO L87 Difference]: Start difference. First operand 712 states and 1003 transitions. Second operand has 4 states, 3 states have (on average 33.0) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:30:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:51,145 INFO L93 Difference]: Finished difference Result 940 states and 1330 transitions. [2025-01-10 06:30:51,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:30:51,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 33.0) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 110 [2025-01-10 06:30:51,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:51,151 INFO L225 Difference]: With dead ends: 940 [2025-01-10 06:30:51,151 INFO L226 Difference]: Without dead ends: 938 [2025-01-10 06:30:51,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-01-10 06:30:51,154 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 379 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:51,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1602 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 06:30:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-01-10 06:30:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 715. [2025-01-10 06:30:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 678 states have (on average 1.4100294985250736) internal successors, (956), 699 states have internal predecessors, (956), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-10 06:30:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1006 transitions. [2025-01-10 06:30:51,181 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1006 transitions. Word has length 110 [2025-01-10 06:30:51,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:51,182 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1006 transitions. [2025-01-10 06:30:51,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 33.0) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-10 06:30:51,183 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1006 transitions. [2025-01-10 06:30:51,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-10 06:30:51,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:51,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 06:30:51,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:30:51,185 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:30:51,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:51,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1291299802, now seen corresponding path program 1 times [2025-01-10 06:30:51,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:51,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331226183] [2025-01-10 06:30:51,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:51,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:51,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-10 06:30:51,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-10 06:30:51,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:51,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:30:51,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:51,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331226183] [2025-01-10 06:30:51,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331226183] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:30:51,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373032037] [2025-01-10 06:30:51,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:51,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:30:51,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:30:51,811 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:30:51,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:30:52,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-10 06:30:52,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-10 06:30:52,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:52,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:52,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-10 06:30:52,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:30:52,178 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 11 treesize of output 7 [2025-01-10 06:30:52,202 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 11 treesize of output 7 [2025-01-10 06:30:52,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 11 [2025-01-10 06:30:52,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-10 06:30:52,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 43 [2025-01-10 06:30:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:30:52,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:30:52,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373032037] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:30:52,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:30:52,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-01-10 06:30:52,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910411044] [2025-01-10 06:30:52,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:30:52,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:30:52,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:30:52,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:30:52,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-01-10 06:30:52,967 INFO L87 Difference]: Start difference. First operand 715 states and 1006 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:30:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 06:30:54,510 INFO L93 Difference]: Finished difference Result 1613 states and 2291 transitions. [2025-01-10 06:30:54,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 06:30:54,511 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 117 [2025-01-10 06:30:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 06:30:54,516 INFO L225 Difference]: With dead ends: 1613 [2025-01-10 06:30:54,516 INFO L226 Difference]: Without dead ends: 938 [2025-01-10 06:30:54,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-01-10 06:30:54,520 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 560 mSDsluCounter, 3538 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 4059 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-10 06:30:54,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 4059 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-10 06:30:54,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-01-10 06:30:54,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 715. [2025-01-10 06:30:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 678 states have (on average 1.4085545722713864) internal successors, (955), 699 states have internal predecessors, (955), 25 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2025-01-10 06:30:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1005 transitions. [2025-01-10 06:30:54,547 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1005 transitions. Word has length 117 [2025-01-10 06:30:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 06:30:54,548 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1005 transitions. [2025-01-10 06:30:54,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-01-10 06:30:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1005 transitions. [2025-01-10 06:30:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-10 06:30:54,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 06:30:54,550 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-10 06:30:54,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 06:30:54,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:30:54,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [test_intErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, test_intErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 06:30:54,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:30:54,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1512197725, now seen corresponding path program 1 times [2025-01-10 06:30:54,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:30:54,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846249907] [2025-01-10 06:30:54,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:54,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:30:54,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-10 06:30:54,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-10 06:30:54,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:54,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:30:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:30:55,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846249907] [2025-01-10 06:30:55,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846249907] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:30:55,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583557213] [2025-01-10 06:30:55,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:30:55,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:30:55,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:30:55,168 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:30:55,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 06:30:55,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-10 06:30:55,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-10 06:30:55,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:30:55,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:30:55,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 06:30:55,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:32:04,456 WARN L286 SmtUtils]: Spent 5.56s on a formula simplification. DAG size of input: 30 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)