./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/loops-crafted-1/discover_list.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/discover_list.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2aca78a4c905fef1e916fc947a81c98263f5056a4b2b5d7ea35195ed74fad5a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:44:59,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:44:59,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:44:59,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:44:59,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:44:59,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:44:59,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:44:59,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:44:59,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:44:59,915 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:44:59,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:44:59,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:44:59,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:44:59,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:44:59,916 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:44:59,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:44:59,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:44:59,916 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:44:59,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:44:59,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:44:59,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:44:59,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:44:59,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:44:59,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:44:59,917 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:44:59,917 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:44:59,917 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:44:59,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:44:59,917 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:44:59,917 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:44:59,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:44:59,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:44:59,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:44:59,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:44:59,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:44:59,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:44:59,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:44:59,918 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:44:59,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:44:59,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:44:59,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:44:59,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:44:59,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:44:59,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:44:59,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:44:59,919 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2aca78a4c905fef1e916fc947a81c98263f5056a4b2b5d7ea35195ed74fad5a5 [2025-03-04 10:45:00,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:45:00,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:45:00,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:45:00,234 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:45:00,234 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:45:00,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/discover_list.c [2025-03-04 10:45:01,392 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca438163/eb17dde1e5344beca846c3e344625cc7/FLAGa83c33415 [2025-03-04 10:45:01,689 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:45:01,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c [2025-03-04 10:45:01,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca438163/eb17dde1e5344beca846c3e344625cc7/FLAGa83c33415 [2025-03-04 10:45:01,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ca438163/eb17dde1e5344beca846c3e344625cc7 [2025-03-04 10:45:01,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:45:01,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:45:01,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:45:01,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:45:01,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:45:01,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:45:01" (1/1) ... [2025-03-04 10:45:01,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af87989 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:01, skipping insertion in model container [2025-03-04 10:45:01,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:45:01" (1/1) ... [2025-03-04 10:45:02,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:45:02,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:45:02,253 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:45:02,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:45:02,328 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:45:02,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:02 WrapperNode [2025-03-04 10:45:02,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:45:02,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:45:02,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:45:02,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:45:02,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:02" (1/1) ... [2025-03-04 10:45:02,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:02" (1/1) ... [2025-03-04 10:45:02,377 INFO L138 Inliner]: procedures = 37, calls = 249, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 570 [2025-03-04 10:45:02,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:45:02,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:45:02,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:45:02,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:45:02,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:02" (1/1) ... [2025-03-04 10:45:02,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:02" (1/1) ... [2025-03-04 10:45:02,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:02" (1/1) ... [2025-03-04 10:45:02,409 INFO L175 MemorySlicer]: Split 181 memory accesses to 7 slices as follows [2, 10, 12, 100, 11, 42, 4]. 55 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 148 writes are split as follows [0, 0, 0, 97, 11, 39, 1]. [2025-03-04 10:45:02,409 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:02" (1/1) ... [2025-03-04 10:45:02,409 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:02" (1/1) ... [2025-03-04 10:45:02,423 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:02" (1/1) ... [2025-03-04 10:45:02,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:02" (1/1) ... [2025-03-04 10:45:02,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:02" (1/1) ... [2025-03-04 10:45:02,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:02" (1/1) ... [2025-03-04 10:45:02,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:45:02,432 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:45:02,432 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:45:02,432 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:45:02,432 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:02" (1/1) ... [2025-03-04 10:45:02,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:45:02,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:45:02,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:45:02,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:45:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:45:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 10:45:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 10:45:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 10:45:02,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 10:45:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 10:45:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 10:45:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 10:45:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:45:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:45:02,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:45:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:45:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 10:45:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 10:45:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 10:45:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 10:45:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:45:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:45:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:45:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 10:45:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 10:45:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 10:45:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 10:45:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 10:45:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 10:45:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 10:45:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 10:45:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 10:45:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 10:45:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 10:45:02,489 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 10:45:02,489 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 10:45:02,490 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 10:45:02,490 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 10:45:02,490 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 10:45:02,490 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 10:45:02,490 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 10:45:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:45:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:45:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:45:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 10:45:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 10:45:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 10:45:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 10:45:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:45:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:45:02,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:45:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:45:02,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:45:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:45:02,609 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:45:02,610 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:45:03,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: havoc do_discover_list_#t~mem100#1; [2025-03-04 10:45:03,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: call ULTIMATE.dealloc(do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset);havoc do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset;call ULTIMATE.dealloc(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset);havoc do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset; [2025-03-04 10:45:03,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L495: call ULTIMATE.dealloc(main_~#tobj~0#1.base, main_~#tobj~0#1.offset);havoc main_~#tobj~0#1.base, main_~#tobj~0#1.offset;call ULTIMATE.dealloc(main_~#opts~0#1.base, main_~#opts~0#1.offset);havoc main_~#opts~0#1.base, main_~#opts~0#1.offset; [2025-03-04 10:45:03,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc smp_send_req_#t~nondet4#1; [2025-03-04 10:45:03,150 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L489: havoc do_discover_list_#t~mem105#1; [2025-03-04 10:45:03,205 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2025-03-04 10:45:03,205 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:45:03,220 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:45:03,220 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:45:03,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:45:03 BoogieIcfgContainer [2025-03-04 10:45:03,221 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:45:03,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:45:03,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:45:03,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:45:03,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:45:01" (1/3) ... [2025-03-04 10:45:03,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f658d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:45:03, skipping insertion in model container [2025-03-04 10:45:03,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:45:02" (2/3) ... [2025-03-04 10:45:03,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f658d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:45:03, skipping insertion in model container [2025-03-04 10:45:03,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:45:03" (3/3) ... [2025-03-04 10:45:03,227 INFO L128 eAbstractionObserver]: Analyzing ICFG discover_list.c [2025-03-04 10:45:03,236 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:45:03,237 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG discover_list.c that has 9 procedures, 188 locations, 1 initial locations, 12 loop locations, and 42 error locations. [2025-03-04 10:45:03,276 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:45:03,284 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;@51ac9316, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:45:03,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-03-04 10:45:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 114 states have (on average 1.719298245614035) internal successors, (196), 156 states have internal predecessors, (196), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:45:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 10:45:03,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:03,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 10:45:03,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:45:03,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:03,297 INFO L85 PathProgramCache]: Analyzing trace with hash 288931, now seen corresponding path program 1 times [2025-03-04 10:45:03,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:03,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902768344] [2025-03-04 10:45:03,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:04,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:45:04,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:45:04,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:04,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:04,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:04,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:04,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902768344] [2025-03-04 10:45:04,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902768344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:45:04,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:45:04,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:45:04,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559240322] [2025-03-04 10:45:04,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:45:04,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:45:04,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:04,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:45:04,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:45:04,557 INFO L87 Difference]: Start difference. First operand has 168 states, 114 states have (on average 1.719298245614035) internal successors, (196), 156 states have internal predecessors, (196), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:45:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:04,613 INFO L93 Difference]: Finished difference Result 317 states and 405 transitions. [2025-03-04 10:45:04,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:45:04,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-03-04 10:45:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:04,620 INFO L225 Difference]: With dead ends: 317 [2025-03-04 10:45:04,620 INFO L226 Difference]: Without dead ends: 148 [2025-03-04 10:45:04,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:45:04,626 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 3 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:04,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 396 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:45:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-04 10:45:04,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-03-04 10:45:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 99 states have (on average 1.6161616161616161) internal successors, (160), 136 states have internal predecessors, (160), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:45:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 176 transitions. [2025-03-04 10:45:04,665 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 176 transitions. Word has length 3 [2025-03-04 10:45:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:04,666 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 176 transitions. [2025-03-04 10:45:04,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:45:04,666 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 176 transitions. [2025-03-04 10:45:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:45:04,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:04,668 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] [2025-03-04 10:45:04,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:45:04,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:45:04,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:04,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1932366063, now seen corresponding path program 1 times [2025-03-04 10:45:04,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:04,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501269786] [2025-03-04 10:45:04,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:04,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:05,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:45:05,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:45:05,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:05,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:05,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:05,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501269786] [2025-03-04 10:45:05,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501269786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:45:05,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:45:05,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:45:05,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084813812] [2025-03-04 10:45:05,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:45:05,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:45:05,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:05,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:45:05,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:45:05,630 INFO L87 Difference]: Start difference. First operand 148 states and 176 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:45:05,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:05,738 INFO L93 Difference]: Finished difference Result 321 states and 386 transitions. [2025-03-04 10:45:05,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:45:05,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-04 10:45:05,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:05,741 INFO L225 Difference]: With dead ends: 321 [2025-03-04 10:45:05,741 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 10:45:05,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:45:05,742 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 41 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:05,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 652 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:45:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 10:45:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 150. [2025-03-04 10:45:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 101 states have (on average 1.603960396039604) internal successors, (162), 138 states have internal predecessors, (162), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:45:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 178 transitions. [2025-03-04 10:45:05,755 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 178 transitions. Word has length 26 [2025-03-04 10:45:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:05,756 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 178 transitions. [2025-03-04 10:45:05,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:45:05,757 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 178 transitions. [2025-03-04 10:45:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:45:05,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:05,758 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] [2025-03-04 10:45:05,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:45:05,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:45:05,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:05,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1365528880, now seen corresponding path program 1 times [2025-03-04 10:45:05,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:05,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111939762] [2025-03-04 10:45:05,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:05,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:06,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:45:06,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:45:06,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:06,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:06,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:06,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111939762] [2025-03-04 10:45:06,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111939762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:45:06,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:45:06,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:45:06,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192893044] [2025-03-04 10:45:06,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:45:06,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:45:06,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:06,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:45:06,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:45:06,560 INFO L87 Difference]: Start difference. First operand 150 states and 178 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:45:06,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:06,608 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2025-03-04 10:45:06,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:45:06,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2025-03-04 10:45:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:06,613 INFO L225 Difference]: With dead ends: 156 [2025-03-04 10:45:06,613 INFO L226 Difference]: Without dead ends: 152 [2025-03-04 10:45:06,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:45:06,613 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 19 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:06,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 462 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:45:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-04 10:45:06,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-03-04 10:45:06,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 105 states have (on average 1.561904761904762) internal successors, (164), 140 states have internal predecessors, (164), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:45:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 180 transitions. [2025-03-04 10:45:06,626 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 180 transitions. Word has length 26 [2025-03-04 10:45:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:06,626 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 180 transitions. [2025-03-04 10:45:06,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:45:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2025-03-04 10:45:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:45:06,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:06,627 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] [2025-03-04 10:45:06,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:45:06,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:45:06,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:06,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1766621227, now seen corresponding path program 1 times [2025-03-04 10:45:06,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:06,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621984442] [2025-03-04 10:45:06,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:06,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:07,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:45:07,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:45:07,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:07,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:08,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:08,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621984442] [2025-03-04 10:45:08,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621984442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:45:08,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:45:08,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:45:08,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217326066] [2025-03-04 10:45:08,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:45:08,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:45:08,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:08,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:45:08,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:45:08,500 INFO L87 Difference]: Start difference. First operand 152 states and 180 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:45:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:08,602 INFO L93 Difference]: Finished difference Result 269 states and 317 transitions. [2025-03-04 10:45:08,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:45:08,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-03-04 10:45:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:08,603 INFO L225 Difference]: With dead ends: 269 [2025-03-04 10:45:08,603 INFO L226 Difference]: Without dead ends: 155 [2025-03-04 10:45:08,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:45:08,606 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 160 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:08,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 484 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:45:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-04 10:45:08,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2025-03-04 10:45:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 107 states have (on average 1.5514018691588785) internal successors, (166), 142 states have internal predecessors, (166), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:45:08,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2025-03-04 10:45:08,618 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 32 [2025-03-04 10:45:08,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:08,618 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2025-03-04 10:45:08,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:45:08,618 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2025-03-04 10:45:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:45:08,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:08,620 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] [2025-03-04 10:45:08,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:45:08,620 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:45:08,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:08,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1735221513, now seen corresponding path program 1 times [2025-03-04 10:45:08,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090351735] [2025-03-04 10:45:08,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:08,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:09,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:45:09,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:45:09,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:09,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:09,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:09,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090351735] [2025-03-04 10:45:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090351735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:45:09,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:45:09,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:45:09,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298045785] [2025-03-04 10:45:09,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:45:09,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:45:09,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:09,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:45:09,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:45:09,262 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:45:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:09,293 INFO L93 Difference]: Finished difference Result 160 states and 188 transitions. [2025-03-04 10:45:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:45:09,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-03-04 10:45:09,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:09,295 INFO L225 Difference]: With dead ends: 160 [2025-03-04 10:45:09,295 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 10:45:09,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:45:09,296 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 2 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:09,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 334 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:45:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 10:45:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2025-03-04 10:45:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 107 states have (on average 1.5514018691588785) internal successors, (166), 142 states have internal predecessors, (166), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:45:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2025-03-04 10:45:09,308 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 32 [2025-03-04 10:45:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:09,308 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2025-03-04 10:45:09,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:45:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2025-03-04 10:45:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:45:09,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:09,311 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] [2025-03-04 10:45:09,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:45:09,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:45:09,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:09,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1735220552, now seen corresponding path program 1 times [2025-03-04 10:45:09,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:09,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490915991] [2025-03-04 10:45:09,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:09,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:09,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:45:09,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:45:09,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:09,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:10,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:10,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490915991] [2025-03-04 10:45:10,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490915991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:45:10,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:45:10,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 10:45:10,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104640671] [2025-03-04 10:45:10,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:45:10,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:45:10,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:10,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:45:10,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:45:10,793 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:45:10,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:10,935 INFO L93 Difference]: Finished difference Result 272 states and 319 transitions. [2025-03-04 10:45:10,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:45:10,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2025-03-04 10:45:10,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:10,936 INFO L225 Difference]: With dead ends: 272 [2025-03-04 10:45:10,937 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 10:45:10,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:45:10,938 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 162 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:10,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 636 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:45:10,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 10:45:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2025-03-04 10:45:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 110 states have (on average 1.5454545454545454) internal successors, (170), 145 states have internal predecessors, (170), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:45:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 186 transitions. [2025-03-04 10:45:10,953 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 186 transitions. Word has length 32 [2025-03-04 10:45:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:10,953 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 186 transitions. [2025-03-04 10:45:10,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:45:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 186 transitions. [2025-03-04 10:45:10,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 10:45:10,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:10,954 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 10:45:10,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:45:10,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:45:10,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:10,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1842477258, now seen corresponding path program 1 times [2025-03-04 10:45:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:10,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698764382] [2025-03-04 10:45:10,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:10,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:11,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:45:11,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:45:11,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:11,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:11,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 10:45:11,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:11,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698764382] [2025-03-04 10:45:11,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698764382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:45:11,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:45:11,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:45:11,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702577258] [2025-03-04 10:45:11,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:45:11,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:45:11,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:45:11,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:45:11,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:45:11,624 INFO L87 Difference]: Start difference. First operand 157 states and 186 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:45:11,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:45:11,659 INFO L93 Difference]: Finished difference Result 270 states and 317 transitions. [2025-03-04 10:45:11,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:45:11,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-03-04 10:45:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:45:11,662 INFO L225 Difference]: With dead ends: 270 [2025-03-04 10:45:11,662 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 10:45:11,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:45:11,663 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:45:11,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 501 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:45:11,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 10:45:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-04 10:45:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 112 states have (on average 1.5357142857142858) internal successors, (172), 147 states have internal predecessors, (172), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 10:45:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 188 transitions. [2025-03-04 10:45:11,677 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 188 transitions. Word has length 35 [2025-03-04 10:45:11,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:45:11,677 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 188 transitions. [2025-03-04 10:45:11,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:45:11,679 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 188 transitions. [2025-03-04 10:45:11,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 10:45:11,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:45:11,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:45:11,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:45:11,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-04 10:45:11,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:45:11,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1873876972, now seen corresponding path program 1 times [2025-03-04 10:45:11,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:45:11,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084751163] [2025-03-04 10:45:11,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:11,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:45:12,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:45:12,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:45:12,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:12,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:45:13,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:45:13,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084751163] [2025-03-04 10:45:13,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084751163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:45:13,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426626465] [2025-03-04 10:45:13,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:45:13,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:45:13,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:45:13,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:45:13,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:45:14,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 10:45:14,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 10:45:14,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:45:14,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:45:14,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:45:14,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:45:14,157 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 485 treesize of output 484 [2025-03-04 10:45:23,258 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 347 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 10:45:31,280 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 10:45:35,290 WARN L851 $PredicateComparison]: unable to prove that (and (= 9 |c_~#smp_def_rrlen_arr~0.base|) (let ((.cse0 (select |c_#memory_int#3| 9))) (= .cse0 (store (store (store (store (let ((.cse33 (+ |c_~#smp_def_rrlen_arr~0.offset| 364))) (store (let ((.cse32 (+ |c_~#smp_def_rrlen_arr~0.offset| 360))) (store (store (store (let ((.cse31 (+ |c_~#smp_def_rrlen_arr~0.offset| 348))) (store (let ((.cse30 (+ |c_~#smp_def_rrlen_arr~0.offset| 344))) (store (store (store (store (let ((.cse29 (+ |c_~#smp_def_rrlen_arr~0.offset| 328))) (store (store (store (let ((.cse28 (+ 316 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse27 (+ |c_~#smp_def_rrlen_arr~0.offset| 308))) (store (store (let ((.cse26 (+ |c_~#smp_def_rrlen_arr~0.offset| 300))) (store (let ((.cse25 (+ 296 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse24 (+ |c_~#smp_def_rrlen_arr~0.offset| 288))) (store (store (let ((.cse23 (+ |c_~#smp_def_rrlen_arr~0.offset| 280))) (store (let ((.cse22 (+ 276 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (let ((.cse21 (+ |c_~#smp_def_rrlen_arr~0.offset| 260))) (store (store (store (store (store (store (let ((.cse20 (+ |c_~#smp_def_rrlen_arr~0.offset| 236))) (store (store (let ((.cse19 (+ 228 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse18 (+ |c_~#smp_def_rrlen_arr~0.offset| 220))) (store (store (let ((.cse17 (+ 212 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse16 (+ |c_~#smp_def_rrlen_arr~0.offset| 208))) (store (let ((.cse15 (+ |c_~#smp_def_rrlen_arr~0.offset| 204))) (store (store (store (store (let ((.cse14 (+ |c_~#smp_def_rrlen_arr~0.offset| 188))) (store (store (store (store (store (store (store (let ((.cse13 (+ 160 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (let ((.cse12 (+ |c_~#smp_def_rrlen_arr~0.offset| 132))) (store (store (let ((.cse11 (+ |c_~#smp_def_rrlen_arr~0.offset| 124))) (store (store (let ((.cse10 (+ 116 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (store (store (store (let ((.cse9 (+ 76 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (let ((.cse8 (+ |c_~#smp_def_rrlen_arr~0.offset| 52))) (store (let ((.cse7 (+ |c_~#smp_def_rrlen_arr~0.offset| 48))) (store (let ((.cse6 (+ |c_~#smp_def_rrlen_arr~0.offset| 44))) (store (let ((.cse5 (+ 40 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse4 (+ |c_~#smp_def_rrlen_arr~0.offset| 36))) (store (let ((.cse3 (+ |c_~#smp_def_rrlen_arr~0.offset| 32))) (store (let ((.cse2 (+ |c_~#smp_def_rrlen_arr~0.offset| 28))) (store (let ((.cse1 (+ |c_~#smp_def_rrlen_arr~0.offset| 24))) (store (store (store (store (store (store (store ((as const (Array Int Int)) 0) |c_~#smp_def_rrlen_arr~0.offset| 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 4) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 8) 6) (+ |c_~#smp_def_rrlen_arr~0.offset| 12) 1) (+ |c_~#smp_def_rrlen_arr~0.offset| 16) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 20) 14) .cse1 (select .cse0 .cse1))) .cse2 (select .cse0 .cse2))) .cse3 (select .cse0 .cse3))) .cse4 (select .cse0 .cse4))) .cse5 (select .cse0 .cse5))) .cse6 (select .cse0 .cse6))) .cse7 (select .cse0 .cse7))) .cse8 (select .cse0 .cse8))) (+ 56 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 60) 5) (+ |c_~#smp_def_rrlen_arr~0.offset| 64) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 68) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 72) 6) .cse9 (select .cse0 .cse9))) (+ |c_~#smp_def_rrlen_arr~0.offset| 80) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 84) 7) (+ 88 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ 92 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 96) 16) (+ |c_~#smp_def_rrlen_arr~0.offset| 100) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 104) 12) (+ |c_~#smp_def_rrlen_arr~0.offset| 108) 17) (+ 112 |c_~#smp_def_rrlen_arr~0.offset|) 2) .cse10 (select .cse0 .cse10))) (+ |c_~#smp_def_rrlen_arr~0.offset| 120) 18) .cse11 (select .cse0 .cse11))) (+ |c_~#smp_def_rrlen_arr~0.offset| 128) 13) .cse12 (select .cse0 .cse12))) (+ |c_~#smp_def_rrlen_arr~0.offset| 136) 2) (+ 140 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 144) 20) (+ |c_~#smp_def_rrlen_arr~0.offset| 148) (- 2)) (+ 152 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 156) 32) .cse13 (select .cse0 .cse13))) (+ |c_~#smp_def_rrlen_arr~0.offset| 164) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 168) 33) (+ |c_~#smp_def_rrlen_arr~0.offset| 172) (- 2)) (+ 176 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 180) 34) (+ |c_~#smp_def_rrlen_arr~0.offset| 184) (- 2)) .cse14 (select .cse0 .cse14))) (+ 192 |c_~#smp_def_rrlen_arr~0.offset|) 128) (+ 196 |c_~#smp_def_rrlen_arr~0.offset|) 3) (+ |c_~#smp_def_rrlen_arr~0.offset| 200) 0) .cse15 (select .cse0 .cse15))) .cse16 (select .cse0 .cse16))) .cse17 (select .cse0 .cse17))) (+ |c_~#smp_def_rrlen_arr~0.offset| 216) 130) .cse18 (select .cse0 .cse18))) (+ |c_~#smp_def_rrlen_arr~0.offset| 224) (- 3)) .cse19 (select .cse0 .cse19))) (+ 232 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) .cse20 (select .cse0 .cse20))) (+ |c_~#smp_def_rrlen_arr~0.offset| 240) 133) (+ |c_~#smp_def_rrlen_arr~0.offset| 244) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 248) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 252) 134) (+ |c_~#smp_def_rrlen_arr~0.offset| 256) (- 2)) .cse21 (select .cse0 .cse21))) (+ |c_~#smp_def_rrlen_arr~0.offset| 264) 135) (+ |c_~#smp_def_rrlen_arr~0.offset| 268) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 272) 0) .cse22 (select .cse0 .cse22))) .cse23 (select .cse0 .cse23))) (+ 284 |c_~#smp_def_rrlen_arr~0.offset|) 0) .cse24 (select .cse0 .cse24))) (+ |c_~#smp_def_rrlen_arr~0.offset| 292) (- 2)) .cse25 (select .cse0 .cse25))) .cse26 (select .cse0 .cse26))) (+ |c_~#smp_def_rrlen_arr~0.offset| 304) (- 2)) .cse27 (select .cse0 .cse27))) (+ |c_~#smp_def_rrlen_arr~0.offset| 312) 139) .cse28 (select .cse0 .cse28))) (+ |c_~#smp_def_rrlen_arr~0.offset| 320) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 324) 144) .cse29 (select .cse0 .cse29))) (+ |c_~#smp_def_rrlen_arr~0.offset| 332) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 336) 145) (+ 340 |c_~#smp_def_rrlen_arr~0.offset|) 9) .cse30 (select .cse0 .cse30))) .cse31 (select .cse0 .cse31))) (+ 352 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ 356 |c_~#smp_def_rrlen_arr~0.offset|) 0) .cse32 (select .cse0 .cse32))) .cse33 (select .cse0 .cse33))) (+ |c_~#smp_def_rrlen_arr~0.offset| 368) 0) (+ 372 |c_~#smp_def_rrlen_arr~0.offset|) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 376) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 380) (- 1))))) is different from false [2025-03-04 10:45:39,309 WARN L873 $PredicateComparison]: unable to prove that (and (= 9 |c_~#smp_def_rrlen_arr~0.base|) (let ((.cse0 (select |c_#memory_int#3| 9))) (= .cse0 (store (store (store (store (let ((.cse33 (+ |c_~#smp_def_rrlen_arr~0.offset| 364))) (store (let ((.cse32 (+ |c_~#smp_def_rrlen_arr~0.offset| 360))) (store (store (store (let ((.cse31 (+ |c_~#smp_def_rrlen_arr~0.offset| 348))) (store (let ((.cse30 (+ |c_~#smp_def_rrlen_arr~0.offset| 344))) (store (store (store (store (let ((.cse29 (+ |c_~#smp_def_rrlen_arr~0.offset| 328))) (store (store (store (let ((.cse28 (+ 316 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse27 (+ |c_~#smp_def_rrlen_arr~0.offset| 308))) (store (store (let ((.cse26 (+ |c_~#smp_def_rrlen_arr~0.offset| 300))) (store (let ((.cse25 (+ 296 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse24 (+ |c_~#smp_def_rrlen_arr~0.offset| 288))) (store (store (let ((.cse23 (+ |c_~#smp_def_rrlen_arr~0.offset| 280))) (store (let ((.cse22 (+ 276 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (let ((.cse21 (+ |c_~#smp_def_rrlen_arr~0.offset| 260))) (store (store (store (store (store (store (let ((.cse20 (+ |c_~#smp_def_rrlen_arr~0.offset| 236))) (store (store (let ((.cse19 (+ 228 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse18 (+ |c_~#smp_def_rrlen_arr~0.offset| 220))) (store (store (let ((.cse17 (+ 212 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse16 (+ |c_~#smp_def_rrlen_arr~0.offset| 208))) (store (let ((.cse15 (+ |c_~#smp_def_rrlen_arr~0.offset| 204))) (store (store (store (store (let ((.cse14 (+ |c_~#smp_def_rrlen_arr~0.offset| 188))) (store (store (store (store (store (store (store (let ((.cse13 (+ 160 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (let ((.cse12 (+ |c_~#smp_def_rrlen_arr~0.offset| 132))) (store (store (let ((.cse11 (+ |c_~#smp_def_rrlen_arr~0.offset| 124))) (store (store (let ((.cse10 (+ 116 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (store (store (store (let ((.cse9 (+ 76 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (let ((.cse8 (+ |c_~#smp_def_rrlen_arr~0.offset| 52))) (store (let ((.cse7 (+ |c_~#smp_def_rrlen_arr~0.offset| 48))) (store (let ((.cse6 (+ |c_~#smp_def_rrlen_arr~0.offset| 44))) (store (let ((.cse5 (+ 40 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse4 (+ |c_~#smp_def_rrlen_arr~0.offset| 36))) (store (let ((.cse3 (+ |c_~#smp_def_rrlen_arr~0.offset| 32))) (store (let ((.cse2 (+ |c_~#smp_def_rrlen_arr~0.offset| 28))) (store (let ((.cse1 (+ |c_~#smp_def_rrlen_arr~0.offset| 24))) (store (store (store (store (store (store (store ((as const (Array Int Int)) 0) |c_~#smp_def_rrlen_arr~0.offset| 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 4) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 8) 6) (+ |c_~#smp_def_rrlen_arr~0.offset| 12) 1) (+ |c_~#smp_def_rrlen_arr~0.offset| 16) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 20) 14) .cse1 (select .cse0 .cse1))) .cse2 (select .cse0 .cse2))) .cse3 (select .cse0 .cse3))) .cse4 (select .cse0 .cse4))) .cse5 (select .cse0 .cse5))) .cse6 (select .cse0 .cse6))) .cse7 (select .cse0 .cse7))) .cse8 (select .cse0 .cse8))) (+ 56 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 60) 5) (+ |c_~#smp_def_rrlen_arr~0.offset| 64) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 68) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 72) 6) .cse9 (select .cse0 .cse9))) (+ |c_~#smp_def_rrlen_arr~0.offset| 80) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 84) 7) (+ 88 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ 92 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 96) 16) (+ |c_~#smp_def_rrlen_arr~0.offset| 100) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 104) 12) (+ |c_~#smp_def_rrlen_arr~0.offset| 108) 17) (+ 112 |c_~#smp_def_rrlen_arr~0.offset|) 2) .cse10 (select .cse0 .cse10))) (+ |c_~#smp_def_rrlen_arr~0.offset| 120) 18) .cse11 (select .cse0 .cse11))) (+ |c_~#smp_def_rrlen_arr~0.offset| 128) 13) .cse12 (select .cse0 .cse12))) (+ |c_~#smp_def_rrlen_arr~0.offset| 136) 2) (+ 140 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 144) 20) (+ |c_~#smp_def_rrlen_arr~0.offset| 148) (- 2)) (+ 152 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 156) 32) .cse13 (select .cse0 .cse13))) (+ |c_~#smp_def_rrlen_arr~0.offset| 164) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 168) 33) (+ |c_~#smp_def_rrlen_arr~0.offset| 172) (- 2)) (+ 176 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 180) 34) (+ |c_~#smp_def_rrlen_arr~0.offset| 184) (- 2)) .cse14 (select .cse0 .cse14))) (+ 192 |c_~#smp_def_rrlen_arr~0.offset|) 128) (+ 196 |c_~#smp_def_rrlen_arr~0.offset|) 3) (+ |c_~#smp_def_rrlen_arr~0.offset| 200) 0) .cse15 (select .cse0 .cse15))) .cse16 (select .cse0 .cse16))) .cse17 (select .cse0 .cse17))) (+ |c_~#smp_def_rrlen_arr~0.offset| 216) 130) .cse18 (select .cse0 .cse18))) (+ |c_~#smp_def_rrlen_arr~0.offset| 224) (- 3)) .cse19 (select .cse0 .cse19))) (+ 232 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) .cse20 (select .cse0 .cse20))) (+ |c_~#smp_def_rrlen_arr~0.offset| 240) 133) (+ |c_~#smp_def_rrlen_arr~0.offset| 244) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 248) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 252) 134) (+ |c_~#smp_def_rrlen_arr~0.offset| 256) (- 2)) .cse21 (select .cse0 .cse21))) (+ |c_~#smp_def_rrlen_arr~0.offset| 264) 135) (+ |c_~#smp_def_rrlen_arr~0.offset| 268) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 272) 0) .cse22 (select .cse0 .cse22))) .cse23 (select .cse0 .cse23))) (+ 284 |c_~#smp_def_rrlen_arr~0.offset|) 0) .cse24 (select .cse0 .cse24))) (+ |c_~#smp_def_rrlen_arr~0.offset| 292) (- 2)) .cse25 (select .cse0 .cse25))) .cse26 (select .cse0 .cse26))) (+ |c_~#smp_def_rrlen_arr~0.offset| 304) (- 2)) .cse27 (select .cse0 .cse27))) (+ |c_~#smp_def_rrlen_arr~0.offset| 312) 139) .cse28 (select .cse0 .cse28))) (+ |c_~#smp_def_rrlen_arr~0.offset| 320) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 324) 144) .cse29 (select .cse0 .cse29))) (+ |c_~#smp_def_rrlen_arr~0.offset| 332) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 336) 145) (+ 340 |c_~#smp_def_rrlen_arr~0.offset|) 9) .cse30 (select .cse0 .cse30))) .cse31 (select .cse0 .cse31))) (+ 352 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ 356 |c_~#smp_def_rrlen_arr~0.offset|) 0) .cse32 (select .cse0 .cse32))) .cse33 (select .cse0 .cse33))) (+ |c_~#smp_def_rrlen_arr~0.offset| 368) 0) (+ 372 |c_~#smp_def_rrlen_arr~0.offset|) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 376) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 380) (- 1))))) is different from true [2025-03-04 10:45:47,333 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 10:45:55,352 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 347 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 10:46:03,376 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 10:46:11,410 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 347 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 10:46:19,431 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 10:46:27,461 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 347 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 10:46:35,484 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 10:46:43,509 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 347 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)