./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 15:00:27,599 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:00:27,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:00:27,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:00:27,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:00:27,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:00:27,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:00:27,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:00:27,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:00:27,680 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:00:27,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:00:27,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:00:27,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:00:27,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:00:27,681 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:00:27,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:00:27,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:00:27,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:00:27,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:00:27,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:00:27,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:00:27,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:00:27,682 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:00:27,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:00:27,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:00:27,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:00:27,682 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:00:27,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:00:27,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:00:27,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:00:27,682 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-17 15:00:27,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:00:27,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:00:27,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:00:27,935 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:00:27,935 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:00:27,936 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-17 15:00:29,150 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f60c84ba3/8a083c7d77df43c783130305162b68c7/FLAG930ee2cca [2025-03-17 15:00:29,424 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:00:29,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c [2025-03-17 15:00:29,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f60c84ba3/8a083c7d77df43c783130305162b68c7/FLAG930ee2cca [2025-03-17 15:00:29,457 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f60c84ba3/8a083c7d77df43c783130305162b68c7 [2025-03-17 15:00:29,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:00:29,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:00:29,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:00:29,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:00:29,470 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:00:29,471 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:00:29" (1/1) ... [2025-03-17 15:00:29,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a9d69f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29, skipping insertion in model container [2025-03-17 15:00:29,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:00:29" (1/1) ... [2025-03-17 15:00:29,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:00:29,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:00:29,692 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:00:29,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:00:29,758 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:00:29,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29 WrapperNode [2025-03-17 15:00:29,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:00:29,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:00:29,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:00:29,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:00:29,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29" (1/1) ... [2025-03-17 15:00:29,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29" (1/1) ... [2025-03-17 15:00:29,798 INFO L138 Inliner]: procedures = 37, calls = 249, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 570 [2025-03-17 15:00:29,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:00:29,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:00:29,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:00:29,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:00:29,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29" (1/1) ... [2025-03-17 15:00:29,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29" (1/1) ... [2025-03-17 15:00:29,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29" (1/1) ... [2025-03-17 15:00:29,824 INFO L175 MemorySlicer]: Split 181 memory accesses to 7 slices as follows [2, 42, 12, 4, 11, 100, 10]. 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, 39, 0, 1, 11, 97, 0]. [2025-03-17 15:00:29,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29" (1/1) ... [2025-03-17 15:00:29,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29" (1/1) ... [2025-03-17 15:00:29,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29" (1/1) ... [2025-03-17 15:00:29,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29" (1/1) ... [2025-03-17 15:00:29,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29" (1/1) ... [2025-03-17 15:00:29,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29" (1/1) ... [2025-03-17 15:00:29,843 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:00:29,846 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:00:29,846 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:00:29,846 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:00:29,847 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29" (1/1) ... [2025-03-17 15:00:29,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:00:29,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:29,876 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-17 15:00:29,878 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-17 15:00:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:00:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-17 15:00:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-17 15:00:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-17 15:00:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-17 15:00:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-17 15:00:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-17 15:00:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-17 15:00:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 15:00:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 15:00:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 15:00:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 15:00:29,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-17 15:00:29,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-17 15:00:29,897 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 15:00:29,897 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 15:00:29,897 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 15:00:29,897 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-17 15:00:29,897 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-17 15:00:29,897 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-17 15:00:29,897 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-17 15:00:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:00:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 15:00:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 15:00:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 15:00:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 15:00:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 15:00:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 15:00:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 15:00:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:00:29,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:00:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:00:29,898 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:00:29,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 15:00:30,021 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:00:30,022 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:00:30,804 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: havoc do_discover_list_#t~mem100#1; [2025-03-17 15:00:30,804 INFO L1322 $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-17 15:00:30,805 INFO L1322 $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-17 15:00:30,805 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc smp_send_req_#t~nondet4#1; [2025-03-17 15:00:30,805 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L489: havoc do_discover_list_#t~mem105#1; [2025-03-17 15:00:30,851 INFO L? ?]: Removed 155 outVars from TransFormulas that were not future-live. [2025-03-17 15:00:30,852 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:00:30,872 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:00:30,872 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:00:30,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:00:30 BoogieIcfgContainer [2025-03-17 15:00:30,874 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:00:30,876 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:00:30,876 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:00:30,879 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:00:30,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:00:29" (1/3) ... [2025-03-17 15:00:30,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3c8228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:00:30, skipping insertion in model container [2025-03-17 15:00:30,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:00:29" (2/3) ... [2025-03-17 15:00:30,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3c8228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:00:30, skipping insertion in model container [2025-03-17 15:00:30,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:00:30" (3/3) ... [2025-03-17 15:00:30,882 INFO L128 eAbstractionObserver]: Analyzing ICFG discover_list.c [2025-03-17 15:00:30,893 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:00:30,895 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG discover_list.c that has 9 procedures, 185 locations, 1 initial locations, 12 loop locations, and 42 error locations. [2025-03-17 15:00:30,937 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:00:30,947 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;@7291f3e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:00:30,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2025-03-17 15:00:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 111 states have (on average 1.7387387387387387) internal successors, (193), 153 states have internal predecessors, (193), 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-17 15:00:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 15:00:30,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:30,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 15:00:30,956 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-17 15:00:30,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:30,960 INFO L85 PathProgramCache]: Analyzing trace with hash 9280, now seen corresponding path program 1 times [2025-03-17 15:00:30,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:30,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064773670] [2025-03-17 15:00:30,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:30,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:31,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 15:00:32,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 15:00:32,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:32,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:32,207 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-17 15:00:32,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:32,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064773670] [2025-03-17 15:00:32,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064773670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:32,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:32,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:00:32,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494640335] [2025-03-17 15:00:32,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:32,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:00:32,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:32,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:00:32,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:00:32,226 INFO L87 Difference]: Start difference. First operand has 165 states, 111 states have (on average 1.7387387387387387) internal successors, (193), 153 states have internal predecessors, (193), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 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-17 15:00:32,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:32,271 INFO L93 Difference]: Finished difference Result 313 states and 401 transitions. [2025-03-17 15:00:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:00:32,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2025-03-17 15:00:32,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:32,276 INFO L225 Difference]: With dead ends: 313 [2025-03-17 15:00:32,276 INFO L226 Difference]: Without dead ends: 149 [2025-03-17 15:00:32,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 15:00:32,280 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 3 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:32,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 392 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:00:32,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-17 15:00:32,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-03-17 15:00:32,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.6428571428571428) internal successors, (161), 137 states have internal predecessors, (161), 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-17 15:00:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2025-03-17 15:00:32,310 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 177 transitions. Word has length 2 [2025-03-17 15:00:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:32,310 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 177 transitions. [2025-03-17 15:00:32,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-17 15:00:32,310 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2025-03-17 15:00:32,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 15:00:32,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:32,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 15:00:32,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:00:32,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-17 15:00:32,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:32,311 INFO L85 PathProgramCache]: Analyzing trace with hash 287906, now seen corresponding path program 1 times [2025-03-17 15:00:32,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:32,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494935852] [2025-03-17 15:00:32,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:32,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:33,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 15:00:33,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 15:00:33,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:33,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:33,246 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-17 15:00:33,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:33,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494935852] [2025-03-17 15:00:33,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494935852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:33,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:33,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 15:00:33,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295574995] [2025-03-17 15:00:33,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:33,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:00:33,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:33,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:00:33,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:00:33,251 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-17 15:00:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:33,275 INFO L93 Difference]: Finished difference Result 149 states and 177 transitions. [2025-03-17 15:00:33,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:00:33,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-17 15:00:33,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:33,277 INFO L225 Difference]: With dead ends: 149 [2025-03-17 15:00:33,277 INFO L226 Difference]: Without dead ends: 147 [2025-03-17 15:00:33,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 15:00:33,278 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 2 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:33,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 339 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:00:33,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-17 15:00:33,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-17 15:00:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 98 states have (on average 1.6224489795918366) internal successors, (159), 135 states have internal predecessors, (159), 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-17 15:00:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 175 transitions. [2025-03-17 15:00:33,293 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 175 transitions. Word has length 3 [2025-03-17 15:00:33,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:33,294 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 175 transitions. [2025-03-17 15:00:33,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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-17 15:00:33,294 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 175 transitions. [2025-03-17 15:00:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 15:00:33,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:33,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:33,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:00:33,295 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-17 15:00:33,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:33,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1971565094, now seen corresponding path program 1 times [2025-03-17 15:00:33,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:33,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899465634] [2025-03-17 15:00:33,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:33,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:34,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 15:00:34,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:00:34,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:34,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:34,119 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-17 15:00:34,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:34,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899465634] [2025-03-17 15:00:34,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899465634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:34,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:34,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:00:34,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845774703] [2025-03-17 15:00:34,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:34,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:00:34,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:34,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:00:34,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:00:34,121 INFO L87 Difference]: Start difference. First operand 147 states and 175 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-17 15:00:34,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:34,561 INFO L93 Difference]: Finished difference Result 320 states and 385 transitions. [2025-03-17 15:00:34,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:00:34,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-17 15:00:34,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:34,564 INFO L225 Difference]: With dead ends: 320 [2025-03-17 15:00:34,565 INFO L226 Difference]: Without dead ends: 181 [2025-03-17 15:00:34,566 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-17 15:00:34,566 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 41 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:34,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 740 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:00:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-17 15:00:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 149. [2025-03-17 15:00:34,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 100 states have (on average 1.61) internal successors, (161), 137 states have internal predecessors, (161), 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-17 15:00:34,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2025-03-17 15:00:34,580 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 177 transitions. Word has length 25 [2025-03-17 15:00:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:34,580 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 177 transitions. [2025-03-17 15:00:34,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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-17 15:00:34,581 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2025-03-17 15:00:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 15:00:34,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:34,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:00:34,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:00:34,582 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-17 15:00:34,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:34,582 INFO L85 PathProgramCache]: Analyzing trace with hash 974492741, now seen corresponding path program 1 times [2025-03-17 15:00:34,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:34,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904878273] [2025-03-17 15:00:34,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:34,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:35,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 15:00:35,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:00:35,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:35,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:35,384 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-17 15:00:35,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:35,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904878273] [2025-03-17 15:00:35,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904878273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:35,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:35,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:00:35,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201619781] [2025-03-17 15:00:35,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:35,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:00:35,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:35,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:00:35,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:00:35,385 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-17 15:00:35,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:35,690 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2025-03-17 15:00:35,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:00:35,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2025-03-17 15:00:35,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:35,692 INFO L225 Difference]: With dead ends: 155 [2025-03-17 15:00:35,692 INFO L226 Difference]: Without dead ends: 151 [2025-03-17 15:00:35,692 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-17 15:00:35,693 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 19 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 459 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.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:35,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 459 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:00:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-17 15:00:35,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-17 15:00:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 104 states have (on average 1.5673076923076923) internal successors, (163), 139 states have internal predecessors, (163), 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-17 15:00:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 179 transitions. [2025-03-17 15:00:35,703 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 179 transitions. Word has length 25 [2025-03-17 15:00:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:35,703 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 179 transitions. [2025-03-17 15:00:35,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-17 15:00:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 179 transitions. [2025-03-17 15:00:35,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 15:00:35,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:35,704 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] [2025-03-17 15:00:35,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:00:35,704 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-17 15:00:35,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:35,705 INFO L85 PathProgramCache]: Analyzing trace with hash 252272426, now seen corresponding path program 1 times [2025-03-17 15:00:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:35,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485341670] [2025-03-17 15:00:35,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:35,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:36,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 15:00:36,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 15:00:36,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:36,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:37,609 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-17 15:00:37,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:37,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485341670] [2025-03-17 15:00:37,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485341670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:37,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:37,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:00:37,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372155776] [2025-03-17 15:00:37,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:37,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:00:37,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:37,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:00:37,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:00:37,613 INFO L87 Difference]: Start difference. First operand 151 states and 179 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:00:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:37,868 INFO L93 Difference]: Finished difference Result 268 states and 316 transitions. [2025-03-17 15:00:37,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:00:37,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-17 15:00:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:37,870 INFO L225 Difference]: With dead ends: 268 [2025-03-17 15:00:37,870 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 15:00:37,870 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-17 15:00:37,871 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 160 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 481 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.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:37,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 481 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:00:37,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 15:00:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2025-03-17 15:00:37,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 106 states have (on average 1.5566037735849056) internal successors, (165), 141 states have internal predecessors, (165), 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-17 15:00:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 181 transitions. [2025-03-17 15:00:37,886 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 181 transitions. Word has length 31 [2025-03-17 15:00:37,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:37,886 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 181 transitions. [2025-03-17 15:00:37,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:00:37,886 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 181 transitions. [2025-03-17 15:00:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 15:00:37,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:37,886 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] [2025-03-17 15:00:37,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:00:37,887 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-17 15:00:37,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:37,887 INFO L85 PathProgramCache]: Analyzing trace with hash 283672140, now seen corresponding path program 1 times [2025-03-17 15:00:37,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:37,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065150599] [2025-03-17 15:00:37,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:37,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:38,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 15:00:38,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 15:00:38,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:38,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:38,688 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-17 15:00:38,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:38,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065150599] [2025-03-17 15:00:38,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065150599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:38,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:38,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:00:38,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012791936] [2025-03-17 15:00:38,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:38,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:00:38,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:38,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:00:38,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:00:38,690 INFO L87 Difference]: Start difference. First operand 153 states and 181 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:00:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:38,766 INFO L93 Difference]: Finished difference Result 159 states and 187 transitions. [2025-03-17 15:00:38,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:00:38,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-17 15:00:38,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:38,768 INFO L225 Difference]: With dead ends: 159 [2025-03-17 15:00:38,768 INFO L226 Difference]: Without dead ends: 157 [2025-03-17 15:00:38,768 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-17 15:00:38,768 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 2 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 332 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:38,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 332 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:38,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-17 15:00:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2025-03-17 15:00:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 106 states have (on average 1.5566037735849056) internal successors, (165), 141 states have internal predecessors, (165), 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-17 15:00:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 181 transitions. [2025-03-17 15:00:38,773 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 181 transitions. Word has length 31 [2025-03-17 15:00:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:38,773 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 181 transitions. [2025-03-17 15:00:38,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:00:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 181 transitions. [2025-03-17 15:00:38,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 15:00:38,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:38,774 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] [2025-03-17 15:00:38,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:00:38,774 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-17 15:00:38,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:38,776 INFO L85 PathProgramCache]: Analyzing trace with hash 283673101, now seen corresponding path program 1 times [2025-03-17 15:00:38,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:38,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958353168] [2025-03-17 15:00:38,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:38,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:39,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 15:00:39,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 15:00:39,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:39,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:40,229 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-17 15:00:40,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:40,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958353168] [2025-03-17 15:00:40,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958353168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:40,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:40,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:00:40,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372018356] [2025-03-17 15:00:40,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:40,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:00:40,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:40,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:00:40,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:00:40,231 INFO L87 Difference]: Start difference. First operand 153 states and 181 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:00:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:40,531 INFO L93 Difference]: Finished difference Result 271 states and 318 transitions. [2025-03-17 15:00:40,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:00:40,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2025-03-17 15:00:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:40,532 INFO L225 Difference]: With dead ends: 271 [2025-03-17 15:00:40,532 INFO L226 Difference]: Without dead ends: 160 [2025-03-17 15:00:40,533 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-17 15:00:40,533 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 162 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 632 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.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:40,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 632 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:00:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-17 15:00:40,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2025-03-17 15:00:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 109 states have (on average 1.5504587155963303) internal successors, (169), 144 states have internal predecessors, (169), 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-17 15:00:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 185 transitions. [2025-03-17 15:00:40,541 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 185 transitions. Word has length 31 [2025-03-17 15:00:40,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:40,543 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 185 transitions. [2025-03-17 15:00:40,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 15:00:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 185 transitions. [2025-03-17 15:00:40,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 15:00:40,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:40,545 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] [2025-03-17 15:00:40,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:00:40,545 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-17 15:00:40,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:40,545 INFO L85 PathProgramCache]: Analyzing trace with hash -18719403, now seen corresponding path program 1 times [2025-03-17 15:00:40,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:40,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528837828] [2025-03-17 15:00:40,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:40,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:41,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 15:00:41,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 15:00:41,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:41,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:41,273 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-17 15:00:41,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:41,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528837828] [2025-03-17 15:00:41,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528837828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:00:41,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:00:41,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:00:41,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342462470] [2025-03-17 15:00:41,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:00:41,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:00:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:00:41,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:00:41,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:00:41,275 INFO L87 Difference]: Start difference. First operand 156 states and 185 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-17 15:00:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:00:41,359 INFO L93 Difference]: Finished difference Result 269 states and 316 transitions. [2025-03-17 15:00:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:00:41,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 34 [2025-03-17 15:00:41,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:00:41,360 INFO L225 Difference]: With dead ends: 269 [2025-03-17 15:00:41,360 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 15:00:41,361 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-17 15:00:41,361 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 498 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:00:41,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 498 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:00:41,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 15:00:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-03-17 15:00:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 111 states have (on average 1.5405405405405406) internal successors, (171), 146 states have internal predecessors, (171), 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-17 15:00:41,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 187 transitions. [2025-03-17 15:00:41,369 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 187 transitions. Word has length 34 [2025-03-17 15:00:41,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:00:41,369 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 187 transitions. [2025-03-17 15:00:41,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-17 15:00:41,369 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 187 transitions. [2025-03-17 15:00:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 15:00:41,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:00:41,371 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] [2025-03-17 15:00:41,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 15:00:41,372 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2025-03-17 15:00:41,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:00:41,372 INFO L85 PathProgramCache]: Analyzing trace with hash 12680311, now seen corresponding path program 1 times [2025-03-17 15:00:41,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:00:41,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143180338] [2025-03-17 15:00:41,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:41,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:00:42,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 15:00:42,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 15:00:42,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:42,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 15:00:43,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:00:43,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143180338] [2025-03-17 15:00:43,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143180338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:00:43,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912090349] [2025-03-17 15:00:43,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:00:43,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:00:43,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:00:43,019 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-17 15:00:43,021 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-17 15:00:43,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 15:00:43,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 15:00:43,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:00:43,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:00:43,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 15:00:43,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:00:44,008 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-17 15:00:54,106 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 371 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 15:01:02,131 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 15:01:10,160 WARN L286 SmtUtils]: Spent 8.03s 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-17 15:01:14,182 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#5| 9)) (.cse2 (+ |c_~#smp_def_rrlen_arr~0.offset| 20))) (let ((.cse3 (select .cse1 .cse2))) (and (= (let ((.cse64 (+ |c_~#smp_def_rrlen_arr~0.offset| 380))) (store (store (store (let ((.cse63 (+ |c_~#smp_def_rrlen_arr~0.offset| 368))) (store (let ((.cse62 (+ |c_~#smp_def_rrlen_arr~0.offset| 364))) (store (let ((.cse61 (+ |c_~#smp_def_rrlen_arr~0.offset| 360))) (store (store (let ((.cse60 (+ 352 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse59 (+ |c_~#smp_def_rrlen_arr~0.offset| 348))) (store (let ((.cse58 (+ |c_~#smp_def_rrlen_arr~0.offset| 344))) (store (store (store (let ((.cse57 (+ |c_~#smp_def_rrlen_arr~0.offset| 332))) (store (let ((.cse56 (+ |c_~#smp_def_rrlen_arr~0.offset| 328))) (store (store (let ((.cse55 (+ |c_~#smp_def_rrlen_arr~0.offset| 320))) (store (let ((.cse54 (+ 316 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse53 (+ |c_~#smp_def_rrlen_arr~0.offset| 308))) (store (let ((.cse52 (+ |c_~#smp_def_rrlen_arr~0.offset| 304))) (store (let ((.cse51 (+ |c_~#smp_def_rrlen_arr~0.offset| 300))) (store (let ((.cse50 (+ 296 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse49 (+ |c_~#smp_def_rrlen_arr~0.offset| 288))) (store (store (let ((.cse48 (+ |c_~#smp_def_rrlen_arr~0.offset| 280))) (store (let ((.cse47 (+ 276 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse46 (+ |c_~#smp_def_rrlen_arr~0.offset| 272))) (store (let ((.cse45 (+ |c_~#smp_def_rrlen_arr~0.offset| 268))) (store (let ((.cse44 (+ |c_~#smp_def_rrlen_arr~0.offset| 264))) (store (let ((.cse43 (+ |c_~#smp_def_rrlen_arr~0.offset| 260))) (store (store (store (let ((.cse42 (+ |c_~#smp_def_rrlen_arr~0.offset| 248))) (store (store (let ((.cse41 (+ |c_~#smp_def_rrlen_arr~0.offset| 240))) (store (let ((.cse40 (+ |c_~#smp_def_rrlen_arr~0.offset| 236))) (store (let ((.cse39 (+ 232 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse38 (+ 228 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse37 (+ |c_~#smp_def_rrlen_arr~0.offset| 224))) (store (let ((.cse36 (+ |c_~#smp_def_rrlen_arr~0.offset| 220))) (store (let ((.cse35 (+ |c_~#smp_def_rrlen_arr~0.offset| 216))) (store (let ((.cse34 (+ 212 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse33 (+ |c_~#smp_def_rrlen_arr~0.offset| 208))) (store (let ((.cse32 (+ |c_~#smp_def_rrlen_arr~0.offset| 204))) (store (store (store (store (let ((.cse31 (+ |c_~#smp_def_rrlen_arr~0.offset| 188))) (store (let ((.cse30 (+ |c_~#smp_def_rrlen_arr~0.offset| 184))) (store (store (let ((.cse29 (+ 176 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse28 (+ |c_~#smp_def_rrlen_arr~0.offset| 168))) (store (store (let ((.cse27 (+ 160 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (let ((.cse26 (+ |c_~#smp_def_rrlen_arr~0.offset| 144))) (store (let ((.cse25 (+ 140 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse24 (+ |c_~#smp_def_rrlen_arr~0.offset| 132))) (store (store (let ((.cse23 (+ |c_~#smp_def_rrlen_arr~0.offset| 124))) (store (store (let ((.cse22 (+ 116 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse21 (+ 112 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse20 (+ |c_~#smp_def_rrlen_arr~0.offset| 104))) (store (let ((.cse19 (+ |c_~#smp_def_rrlen_arr~0.offset| 100))) (store (let ((.cse18 (+ |c_~#smp_def_rrlen_arr~0.offset| 96))) (store (store (store (store (let ((.cse17 (+ |c_~#smp_def_rrlen_arr~0.offset| 80))) (store (let ((.cse16 (+ 76 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse15 (+ |c_~#smp_def_rrlen_arr~0.offset| 72))) (store (let ((.cse14 (+ |c_~#smp_def_rrlen_arr~0.offset| 68))) (store (let ((.cse13 (+ |c_~#smp_def_rrlen_arr~0.offset| 64))) (store (store (let ((.cse12 (+ 56 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse11 (+ |c_~#smp_def_rrlen_arr~0.offset| 52))) (store (let ((.cse10 (+ |c_~#smp_def_rrlen_arr~0.offset| 48))) (store (let ((.cse9 (+ |c_~#smp_def_rrlen_arr~0.offset| 44))) (store (let ((.cse8 (+ 40 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse7 (+ |c_~#smp_def_rrlen_arr~0.offset| 36))) (store (let ((.cse6 (+ |c_~#smp_def_rrlen_arr~0.offset| 32))) (store (let ((.cse5 (+ |c_~#smp_def_rrlen_arr~0.offset| 28))) (store (let ((.cse4 (+ |c_~#smp_def_rrlen_arr~0.offset| 24))) (store (store (store (store (let ((.cse0 (+ |c_~#smp_def_rrlen_arr~0.offset| 8))) (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) .cse0 (select .cse1 .cse0))) (+ |c_~#smp_def_rrlen_arr~0.offset| 12) 1) (+ |c_~#smp_def_rrlen_arr~0.offset| 16) 0) .cse2 .cse3) .cse4 (select .cse1 .cse4))) .cse5 (select .cse1 .cse5))) .cse6 (select .cse1 .cse6))) .cse7 (select .cse1 .cse7))) .cse8 (select .cse1 .cse8))) .cse9 (select .cse1 .cse9))) .cse10 (select .cse1 .cse10))) .cse11 (select .cse1 .cse11))) .cse12 (select .cse1 .cse12))) (+ |c_~#smp_def_rrlen_arr~0.offset| 60) 5) .cse13 (select .cse1 .cse13))) .cse14 (select .cse1 .cse14))) .cse15 (select .cse1 .cse15))) .cse16 (select .cse1 .cse16))) .cse17 (select .cse1 .cse17))) (+ |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)) .cse18 (select .cse1 .cse18))) .cse19 (select .cse1 .cse19))) .cse20 (select .cse1 .cse20))) (+ |c_~#smp_def_rrlen_arr~0.offset| 108) 17) .cse21 (select .cse1 .cse21))) .cse22 (select .cse1 .cse22))) (+ |c_~#smp_def_rrlen_arr~0.offset| 120) 18) .cse23 (select .cse1 .cse23))) (+ |c_~#smp_def_rrlen_arr~0.offset| 128) 13) .cse24 (select .cse1 .cse24))) (+ |c_~#smp_def_rrlen_arr~0.offset| 136) 2) .cse25 (select .cse1 .cse25))) .cse26 (select .cse1 .cse26))) (+ |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) .cse27 (select .cse1 .cse27))) (+ |c_~#smp_def_rrlen_arr~0.offset| 164) (- 2)) .cse28 (select .cse1 .cse28))) (+ |c_~#smp_def_rrlen_arr~0.offset| 172) (- 2)) .cse29 (select .cse1 .cse29))) (+ |c_~#smp_def_rrlen_arr~0.offset| 180) 34) .cse30 (select .cse1 .cse30))) .cse31 (select .cse1 .cse31))) (+ 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) .cse32 (select .cse1 .cse32))) .cse33 (select .cse1 .cse33))) .cse34 (select .cse1 .cse34))) .cse35 (select .cse1 .cse35))) .cse36 (select .cse1 .cse36))) .cse37 (select .cse1 .cse37))) .cse38 (select .cse1 .cse38))) .cse39 (select .cse1 .cse39))) .cse40 (select .cse1 .cse40))) .cse41 (select .cse1 .cse41))) (+ |c_~#smp_def_rrlen_arr~0.offset| 244) (- 2)) .cse42 (select .cse1 .cse42))) (+ |c_~#smp_def_rrlen_arr~0.offset| 252) 134) (+ |c_~#smp_def_rrlen_arr~0.offset| 256) (- 2)) .cse43 (select .cse1 .cse43))) .cse44 (select .cse1 .cse44))) .cse45 (select .cse1 .cse45))) .cse46 (select .cse1 .cse46))) .cse47 (select .cse1 .cse47))) .cse48 (select .cse1 .cse48))) (+ 284 |c_~#smp_def_rrlen_arr~0.offset|) 0) .cse49 (select .cse1 .cse49))) (+ |c_~#smp_def_rrlen_arr~0.offset| 292) (- 2)) .cse50 (select .cse1 .cse50))) .cse51 (select .cse1 .cse51))) .cse52 (select .cse1 .cse52))) .cse53 (select .cse1 .cse53))) (+ |c_~#smp_def_rrlen_arr~0.offset| 312) 139) .cse54 (select .cse1 .cse54))) .cse55 (select .cse1 .cse55))) (+ |c_~#smp_def_rrlen_arr~0.offset| 324) 144) .cse56 (select .cse1 .cse56))) .cse57 (select .cse1 .cse57))) (+ |c_~#smp_def_rrlen_arr~0.offset| 336) 145) (+ 340 |c_~#smp_def_rrlen_arr~0.offset|) 9) .cse58 (select .cse1 .cse58))) .cse59 (select .cse1 .cse59))) .cse60 (select .cse1 .cse60))) (+ 356 |c_~#smp_def_rrlen_arr~0.offset|) 0) .cse61 (select .cse1 .cse61))) .cse62 (select .cse1 .cse62))) .cse63 (select .cse1 .cse63))) (+ 372 |c_~#smp_def_rrlen_arr~0.offset|) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 376) (- 1)) .cse64 (select .cse1 .cse64))) .cse1) (<= .cse3 14) (= 9 |c_~#smp_def_rrlen_arr~0.base|)))) is different from false [2025-03-17 15:01:18,199 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#5| 9)) (.cse2 (+ |c_~#smp_def_rrlen_arr~0.offset| 20))) (let ((.cse3 (select .cse1 .cse2))) (and (= (let ((.cse64 (+ |c_~#smp_def_rrlen_arr~0.offset| 380))) (store (store (store (let ((.cse63 (+ |c_~#smp_def_rrlen_arr~0.offset| 368))) (store (let ((.cse62 (+ |c_~#smp_def_rrlen_arr~0.offset| 364))) (store (let ((.cse61 (+ |c_~#smp_def_rrlen_arr~0.offset| 360))) (store (store (let ((.cse60 (+ 352 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse59 (+ |c_~#smp_def_rrlen_arr~0.offset| 348))) (store (let ((.cse58 (+ |c_~#smp_def_rrlen_arr~0.offset| 344))) (store (store (store (let ((.cse57 (+ |c_~#smp_def_rrlen_arr~0.offset| 332))) (store (let ((.cse56 (+ |c_~#smp_def_rrlen_arr~0.offset| 328))) (store (store (let ((.cse55 (+ |c_~#smp_def_rrlen_arr~0.offset| 320))) (store (let ((.cse54 (+ 316 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse53 (+ |c_~#smp_def_rrlen_arr~0.offset| 308))) (store (let ((.cse52 (+ |c_~#smp_def_rrlen_arr~0.offset| 304))) (store (let ((.cse51 (+ |c_~#smp_def_rrlen_arr~0.offset| 300))) (store (let ((.cse50 (+ 296 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse49 (+ |c_~#smp_def_rrlen_arr~0.offset| 288))) (store (store (let ((.cse48 (+ |c_~#smp_def_rrlen_arr~0.offset| 280))) (store (let ((.cse47 (+ 276 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse46 (+ |c_~#smp_def_rrlen_arr~0.offset| 272))) (store (let ((.cse45 (+ |c_~#smp_def_rrlen_arr~0.offset| 268))) (store (let ((.cse44 (+ |c_~#smp_def_rrlen_arr~0.offset| 264))) (store (let ((.cse43 (+ |c_~#smp_def_rrlen_arr~0.offset| 260))) (store (store (store (let ((.cse42 (+ |c_~#smp_def_rrlen_arr~0.offset| 248))) (store (store (let ((.cse41 (+ |c_~#smp_def_rrlen_arr~0.offset| 240))) (store (let ((.cse40 (+ |c_~#smp_def_rrlen_arr~0.offset| 236))) (store (let ((.cse39 (+ 232 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse38 (+ 228 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse37 (+ |c_~#smp_def_rrlen_arr~0.offset| 224))) (store (let ((.cse36 (+ |c_~#smp_def_rrlen_arr~0.offset| 220))) (store (let ((.cse35 (+ |c_~#smp_def_rrlen_arr~0.offset| 216))) (store (let ((.cse34 (+ 212 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse33 (+ |c_~#smp_def_rrlen_arr~0.offset| 208))) (store (let ((.cse32 (+ |c_~#smp_def_rrlen_arr~0.offset| 204))) (store (store (store (store (let ((.cse31 (+ |c_~#smp_def_rrlen_arr~0.offset| 188))) (store (let ((.cse30 (+ |c_~#smp_def_rrlen_arr~0.offset| 184))) (store (store (let ((.cse29 (+ 176 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse28 (+ |c_~#smp_def_rrlen_arr~0.offset| 168))) (store (store (let ((.cse27 (+ 160 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (let ((.cse26 (+ |c_~#smp_def_rrlen_arr~0.offset| 144))) (store (let ((.cse25 (+ 140 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse24 (+ |c_~#smp_def_rrlen_arr~0.offset| 132))) (store (store (let ((.cse23 (+ |c_~#smp_def_rrlen_arr~0.offset| 124))) (store (store (let ((.cse22 (+ 116 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse21 (+ 112 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (let ((.cse20 (+ |c_~#smp_def_rrlen_arr~0.offset| 104))) (store (let ((.cse19 (+ |c_~#smp_def_rrlen_arr~0.offset| 100))) (store (let ((.cse18 (+ |c_~#smp_def_rrlen_arr~0.offset| 96))) (store (store (store (store (let ((.cse17 (+ |c_~#smp_def_rrlen_arr~0.offset| 80))) (store (let ((.cse16 (+ 76 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse15 (+ |c_~#smp_def_rrlen_arr~0.offset| 72))) (store (let ((.cse14 (+ |c_~#smp_def_rrlen_arr~0.offset| 68))) (store (let ((.cse13 (+ |c_~#smp_def_rrlen_arr~0.offset| 64))) (store (store (let ((.cse12 (+ 56 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse11 (+ |c_~#smp_def_rrlen_arr~0.offset| 52))) (store (let ((.cse10 (+ |c_~#smp_def_rrlen_arr~0.offset| 48))) (store (let ((.cse9 (+ |c_~#smp_def_rrlen_arr~0.offset| 44))) (store (let ((.cse8 (+ 40 |c_~#smp_def_rrlen_arr~0.offset|))) (store (let ((.cse7 (+ |c_~#smp_def_rrlen_arr~0.offset| 36))) (store (let ((.cse6 (+ |c_~#smp_def_rrlen_arr~0.offset| 32))) (store (let ((.cse5 (+ |c_~#smp_def_rrlen_arr~0.offset| 28))) (store (let ((.cse4 (+ |c_~#smp_def_rrlen_arr~0.offset| 24))) (store (store (store (store (let ((.cse0 (+ |c_~#smp_def_rrlen_arr~0.offset| 8))) (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) .cse0 (select .cse1 .cse0))) (+ |c_~#smp_def_rrlen_arr~0.offset| 12) 1) (+ |c_~#smp_def_rrlen_arr~0.offset| 16) 0) .cse2 .cse3) .cse4 (select .cse1 .cse4))) .cse5 (select .cse1 .cse5))) .cse6 (select .cse1 .cse6))) .cse7 (select .cse1 .cse7))) .cse8 (select .cse1 .cse8))) .cse9 (select .cse1 .cse9))) .cse10 (select .cse1 .cse10))) .cse11 (select .cse1 .cse11))) .cse12 (select .cse1 .cse12))) (+ |c_~#smp_def_rrlen_arr~0.offset| 60) 5) .cse13 (select .cse1 .cse13))) .cse14 (select .cse1 .cse14))) .cse15 (select .cse1 .cse15))) .cse16 (select .cse1 .cse16))) .cse17 (select .cse1 .cse17))) (+ |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)) .cse18 (select .cse1 .cse18))) .cse19 (select .cse1 .cse19))) .cse20 (select .cse1 .cse20))) (+ |c_~#smp_def_rrlen_arr~0.offset| 108) 17) .cse21 (select .cse1 .cse21))) .cse22 (select .cse1 .cse22))) (+ |c_~#smp_def_rrlen_arr~0.offset| 120) 18) .cse23 (select .cse1 .cse23))) (+ |c_~#smp_def_rrlen_arr~0.offset| 128) 13) .cse24 (select .cse1 .cse24))) (+ |c_~#smp_def_rrlen_arr~0.offset| 136) 2) .cse25 (select .cse1 .cse25))) .cse26 (select .cse1 .cse26))) (+ |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) .cse27 (select .cse1 .cse27))) (+ |c_~#smp_def_rrlen_arr~0.offset| 164) (- 2)) .cse28 (select .cse1 .cse28))) (+ |c_~#smp_def_rrlen_arr~0.offset| 172) (- 2)) .cse29 (select .cse1 .cse29))) (+ |c_~#smp_def_rrlen_arr~0.offset| 180) 34) .cse30 (select .cse1 .cse30))) .cse31 (select .cse1 .cse31))) (+ 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) .cse32 (select .cse1 .cse32))) .cse33 (select .cse1 .cse33))) .cse34 (select .cse1 .cse34))) .cse35 (select .cse1 .cse35))) .cse36 (select .cse1 .cse36))) .cse37 (select .cse1 .cse37))) .cse38 (select .cse1 .cse38))) .cse39 (select .cse1 .cse39))) .cse40 (select .cse1 .cse40))) .cse41 (select .cse1 .cse41))) (+ |c_~#smp_def_rrlen_arr~0.offset| 244) (- 2)) .cse42 (select .cse1 .cse42))) (+ |c_~#smp_def_rrlen_arr~0.offset| 252) 134) (+ |c_~#smp_def_rrlen_arr~0.offset| 256) (- 2)) .cse43 (select .cse1 .cse43))) .cse44 (select .cse1 .cse44))) .cse45 (select .cse1 .cse45))) .cse46 (select .cse1 .cse46))) .cse47 (select .cse1 .cse47))) .cse48 (select .cse1 .cse48))) (+ 284 |c_~#smp_def_rrlen_arr~0.offset|) 0) .cse49 (select .cse1 .cse49))) (+ |c_~#smp_def_rrlen_arr~0.offset| 292) (- 2)) .cse50 (select .cse1 .cse50))) .cse51 (select .cse1 .cse51))) .cse52 (select .cse1 .cse52))) .cse53 (select .cse1 .cse53))) (+ |c_~#smp_def_rrlen_arr~0.offset| 312) 139) .cse54 (select .cse1 .cse54))) .cse55 (select .cse1 .cse55))) (+ |c_~#smp_def_rrlen_arr~0.offset| 324) 144) .cse56 (select .cse1 .cse56))) .cse57 (select .cse1 .cse57))) (+ |c_~#smp_def_rrlen_arr~0.offset| 336) 145) (+ 340 |c_~#smp_def_rrlen_arr~0.offset|) 9) .cse58 (select .cse1 .cse58))) .cse59 (select .cse1 .cse59))) .cse60 (select .cse1 .cse60))) (+ 356 |c_~#smp_def_rrlen_arr~0.offset|) 0) .cse61 (select .cse1 .cse61))) .cse62 (select .cse1 .cse62))) .cse63 (select .cse1 .cse63))) (+ 372 |c_~#smp_def_rrlen_arr~0.offset|) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 376) (- 1)) .cse64 (select .cse1 .cse64))) .cse1) (<= .cse3 14) (= 9 |c_~#smp_def_rrlen_arr~0.base|)))) is different from true [2025-03-17 15:01:26,231 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 15:01:34,248 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-17 15:01:42,274 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 371 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 15:01:50,305 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 15:01:58,325 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-17 15:02:06,353 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 371 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)