./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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.2.5-?-c7c6ca5-m [2024-11-09 11:27:03,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 11:27:04,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-09 11:27:04,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 11:27:04,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 11:27:04,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 11:27:04,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 11:27:04,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 11:27:04,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 11:27:04,053 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 11:27:04,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 11:27:04,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 11:27:04,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 11:27:04,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 11:27:04,054 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 11:27:04,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 11:27:04,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 11:27:04,058 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 11:27:04,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 11:27:04,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 11:27:04,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 11:27:04,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 11:27:04,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 11:27:04,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 11:27:04,060 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 11:27:04,060 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 11:27:04,060 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 11:27:04,061 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 11:27:04,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 11:27:04,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 11:27:04,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 11:27:04,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 11:27:04,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 11:27:04,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 11:27:04,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:27:04,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 11:27:04,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 11:27:04,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 11:27:04,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 11:27:04,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 11:27:04,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 11:27:04,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 11:27:04,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 11:27:04,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 11:27:04,064 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-11-09 11:27:04,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 11:27:04,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 11:27:04,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 11:27:04,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 11:27:04,329 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 11:27:04,330 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 [2024-11-09 11:27:05,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 11:27:05,769 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 11:27:05,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c [2024-11-09 11:27:05,779 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eff3017e/7ffebc80fae24464a2b27e88549c6941/FLAG71874e748 [2024-11-09 11:27:05,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eff3017e/7ffebc80fae24464a2b27e88549c6941 [2024-11-09 11:27:05,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 11:27:05,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 11:27:05,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 11:27:05,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 11:27:05,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 11:27:05,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:27:05" (1/1) ... [2024-11-09 11:27:05,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b767903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:05, skipping insertion in model container [2024-11-09 11:27:05,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:27:05" (1/1) ... [2024-11-09 11:27:05,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 11:27:06,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:27:06,103 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 11:27:06,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 11:27:06,177 INFO L204 MainTranslator]: Completed translation [2024-11-09 11:27:06,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:06 WrapperNode [2024-11-09 11:27:06,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 11:27:06,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 11:27:06,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 11:27:06,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 11:27:06,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:06" (1/1) ... [2024-11-09 11:27:06,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:06" (1/1) ... [2024-11-09 11:27:06,232 INFO L138 Inliner]: procedures = 37, calls = 249, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 574 [2024-11-09 11:27:06,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 11:27:06,233 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 11:27:06,233 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 11:27:06,233 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 11:27:06,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:06" (1/1) ... [2024-11-09 11:27:06,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:06" (1/1) ... [2024-11-09 11:27:06,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:06" (1/1) ... [2024-11-09 11:27:06,280 INFO L175 MemorySlicer]: Split 181 memory accesses to 7 slices as follows [2, 12, 100, 4, 11, 10, 42]. 55 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 148 writes are split as follows [0, 0, 97, 1, 11, 0, 39]. [2024-11-09 11:27:06,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:06" (1/1) ... [2024-11-09 11:27:06,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:06" (1/1) ... [2024-11-09 11:27:06,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:06" (1/1) ... [2024-11-09 11:27:06,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:06" (1/1) ... [2024-11-09 11:27:06,301 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:06" (1/1) ... [2024-11-09 11:27:06,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:06" (1/1) ... [2024-11-09 11:27:06,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 11:27:06,309 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 11:27:06,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 11:27:06,310 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 11:27:06,310 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:06" (1/1) ... [2024-11-09 11:27:06,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 11:27:06,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:27:06,367 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) [2024-11-09 11:27:06,370 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 [2024-11-09 11:27:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 11:27:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-09 11:27:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-09 11:27:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-09 11:27:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-09 11:27:06,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-09 11:27:06,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-09 11:27:06,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-09 11:27:06,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 11:27:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 11:27:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 11:27:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 11:27:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 11:27:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-09 11:27:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-09 11:27:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-09 11:27:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 11:27:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 11:27:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 11:27:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 11:27:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-09 11:27:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-09 11:27:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-09 11:27:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 11:27:06,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 11:27:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 11:27:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-11-09 11:27:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-11-09 11:27:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2024-11-09 11:27:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2024-11-09 11:27:06,413 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 11:27:06,413 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 11:27:06,414 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 11:27:06,414 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-11-09 11:27:06,414 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-11-09 11:27:06,414 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2024-11-09 11:27:06,414 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2024-11-09 11:27:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 11:27:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 11:27:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 11:27:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 11:27:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-09 11:27:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-09 11:27:06,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-09 11:27:06,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 11:27:06,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 11:27:06,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 11:27:06,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 11:27:06,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 11:27:06,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 11:27:06,574 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 11:27:06,580 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 11:27:07,358 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2024-11-09 11:27:07,358 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 11:27:07,369 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 11:27:07,369 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 11:27:07,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:27:07 BoogieIcfgContainer [2024-11-09 11:27:07,370 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 11:27:07,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 11:27:07,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 11:27:07,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 11:27:07,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:27:05" (1/3) ... [2024-11-09 11:27:07,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf7e707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:27:07, skipping insertion in model container [2024-11-09 11:27:07,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:27:06" (2/3) ... [2024-11-09 11:27:07,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf7e707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:27:07, skipping insertion in model container [2024-11-09 11:27:07,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 11:27:07" (3/3) ... [2024-11-09 11:27:07,377 INFO L112 eAbstractionObserver]: Analyzing ICFG discover_list.c [2024-11-09 11:27:07,389 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 11:27:07,389 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-11-09 11:27:07,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 11:27:07,450 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;@2f215f18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 11:27:07,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-11-09 11:27:07,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 114 states have (on average 1.7280701754385965) internal successors, (197), 156 states have internal predecessors, (197), 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) [2024-11-09 11:27:07,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 11:27:07,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:07,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 11:27:07,459 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-09 11:27:07,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash 85464, now seen corresponding path program 1 times [2024-11-09 11:27:07,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:07,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308298999] [2024-11-09 11:27:07,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:07,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:08,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:08,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308298999] [2024-11-09 11:27:08,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308298999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:27:08,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:27:08,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 11:27:08,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243677429] [2024-11-09 11:27:08,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:27:08,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 11:27:08,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:27:08,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 11:27:08,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 11:27:08,926 INFO L87 Difference]: Start difference. First operand has 168 states, 114 states have (on average 1.7280701754385965) internal successors, (197), 156 states have internal predecessors, (197), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:27:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:27:08,982 INFO L93 Difference]: Finished difference Result 317 states and 407 transitions. [2024-11-09 11:27:08,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 11:27:08,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 11:27:08,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:27:08,995 INFO L225 Difference]: With dead ends: 317 [2024-11-09 11:27:08,995 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 11:27:08,997 INFO L431 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 [2024-11-09 11:27:09,000 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 3 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 11:27:09,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 398 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 11:27:09,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 11:27:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-11-09 11:27:09,033 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) [2024-11-09 11:27:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2024-11-09 11:27:09,036 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 177 transitions. Word has length 3 [2024-11-09 11:27:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:27:09,036 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 177 transitions. [2024-11-09 11:27:09,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 11:27:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2024-11-09 11:27:09,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 11:27:09,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:09,038 INFO L215 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] [2024-11-09 11:27:09,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 11:27:09,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-09 11:27:09,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:09,039 INFO L85 PathProgramCache]: Analyzing trace with hash 297678372, now seen corresponding path program 1 times [2024-11-09 11:27:09,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:09,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788509163] [2024-11-09 11:27:09,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:09,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:10,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:27:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:10,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:10,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788509163] [2024-11-09 11:27:10,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788509163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:27:10,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:27:10,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:27:10,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269986707] [2024-11-09 11:27:10,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:27:10,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:27:10,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:27:10,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:27:10,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:27:10,014 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:27:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:27:10,127 INFO L93 Difference]: Finished difference Result 295 states and 351 transitions. [2024-11-09 11:27:10,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:27:10,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-09 11:27:10,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:27:10,131 INFO L225 Difference]: With dead ends: 295 [2024-11-09 11:27:10,131 INFO L226 Difference]: Without dead ends: 155 [2024-11-09 11:27:10,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:27:10,134 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 11 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:27:10,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 469 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:27:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-09 11:27:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2024-11-09 11:27:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 102 states have (on average 1.5980392156862746) 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) [2024-11-09 11:27:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 179 transitions. [2024-11-09 11:27:10,148 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 179 transitions. Word has length 26 [2024-11-09 11:27:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:27:10,148 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 179 transitions. [2024-11-09 11:27:10,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:27:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 179 transitions. [2024-11-09 11:27:10,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 11:27:10,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:10,149 INFO L215 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] [2024-11-09 11:27:10,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 11:27:10,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-09 11:27:10,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:10,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1696466334, now seen corresponding path program 1 times [2024-11-09 11:27:10,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:10,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124308570] [2024-11-09 11:27:10,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:10,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:11,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:27:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:11,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:11,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124308570] [2024-11-09 11:27:11,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124308570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:27:11,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:27:11,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:27:11,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172992600] [2024-11-09 11:27:11,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:27:11,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:27:11,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:27:11,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:27:11,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:27:11,105 INFO L87 Difference]: Start difference. First operand 151 states and 179 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:27:11,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:27:11,184 INFO L93 Difference]: Finished difference Result 154 states and 183 transitions. [2024-11-09 11:27:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:27:11,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-09 11:27:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:27:11,186 INFO L225 Difference]: With dead ends: 154 [2024-11-09 11:27:11,186 INFO L226 Difference]: Without dead ends: 152 [2024-11-09 11:27:11,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:27:11,187 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 40 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:27:11,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 434 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:27:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-09 11:27:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 149. [2024-11-09 11:27:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 102 states have (on average 1.5784313725490196) 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) [2024-11-09 11:27:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2024-11-09 11:27:11,194 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 177 transitions. Word has length 26 [2024-11-09 11:27:11,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:27:11,194 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 177 transitions. [2024-11-09 11:27:11,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:27:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2024-11-09 11:27:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 11:27:11,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:11,195 INFO L215 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] [2024-11-09 11:27:11,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 11:27:11,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-09 11:27:11,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:11,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1050848603, now seen corresponding path program 1 times [2024-11-09 11:27:11,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:11,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565532553] [2024-11-09 11:27:11,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:11,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:12,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:27:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:12,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:12,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565532553] [2024-11-09 11:27:12,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565532553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:27:12,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:27:12,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 11:27:12,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017135789] [2024-11-09 11:27:12,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:27:12,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:27:12,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:27:12,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:27:12,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:27:12,093 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2024-11-09 11:27:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:27:12,170 INFO L93 Difference]: Finished difference Result 159 states and 189 transitions. [2024-11-09 11:27:12,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:27:12,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-09 11:27:12,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:27:12,172 INFO L225 Difference]: With dead ends: 159 [2024-11-09 11:27:12,172 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 11:27:12,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:27:12,173 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 31 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:27:12,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 439 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:27:12,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 11:27:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2024-11-09 11:27:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 107 states have (on average 1.560747663551402) internal successors, (167), 142 states have internal predecessors, (167), 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) [2024-11-09 11:27:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 183 transitions. [2024-11-09 11:27:12,183 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 183 transitions. Word has length 27 [2024-11-09 11:27:12,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:27:12,184 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 183 transitions. [2024-11-09 11:27:12,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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) [2024-11-09 11:27:12,184 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 183 transitions. [2024-11-09 11:27:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 11:27:12,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:12,185 INFO L215 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] [2024-11-09 11:27:12,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 11:27:12,185 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-09 11:27:12,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:12,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1050789021, now seen corresponding path program 1 times [2024-11-09 11:27:12,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:12,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400603652] [2024-11-09 11:27:12,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:12,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:13,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:27:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:13,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:13,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400603652] [2024-11-09 11:27:13,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400603652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:27:13,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:27:13,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 11:27:13,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237562665] [2024-11-09 11:27:13,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:27:13,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 11:27:13,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:27:13,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 11:27:13,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 11:27:13,064 INFO L87 Difference]: Start difference. First operand 154 states and 183 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-09 11:27:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:27:13,134 INFO L93 Difference]: Finished difference Result 163 states and 193 transitions. [2024-11-09 11:27:13,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 11:27:13,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-09 11:27:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:27:13,135 INFO L225 Difference]: With dead ends: 163 [2024-11-09 11:27:13,138 INFO L226 Difference]: Without dead ends: 161 [2024-11-09 11:27:13,138 INFO L431 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 [2024-11-09 11:27:13,139 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 21 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:27:13,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 443 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:27:13,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-09 11:27:13,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2024-11-09 11:27:13,151 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) [2024-11-09 11:27:13,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 181 transitions. [2024-11-09 11:27:13,152 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 181 transitions. Word has length 27 [2024-11-09 11:27:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:27:13,152 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 181 transitions. [2024-11-09 11:27:13,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2024-11-09 11:27:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 181 transitions. [2024-11-09 11:27:13,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 11:27:13,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:13,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:27:13,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 11:27:13,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-09 11:27:13,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:13,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1206794743, now seen corresponding path program 1 times [2024-11-09 11:27:13,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:13,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026886451] [2024-11-09 11:27:13,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:13,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:15,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:27:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:15,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:15,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026886451] [2024-11-09 11:27:15,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026886451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:27:15,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:27:15,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:27:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958040117] [2024-11-09 11:27:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:27:15,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 11:27:15,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:27:15,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 11:27:15,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 11:27:15,203 INFO L87 Difference]: Start difference. First operand 153 states and 181 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:27:15,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:27:15,363 INFO L93 Difference]: Finished difference Result 278 states and 327 transitions. [2024-11-09 11:27:15,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 11:27:15,363 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-09 11:27:15,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:27:15,364 INFO L225 Difference]: With dead ends: 278 [2024-11-09 11:27:15,365 INFO L226 Difference]: Without dead ends: 160 [2024-11-09 11:27:15,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-09 11:27:15,368 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 169 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:27:15,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 601 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:27:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-09 11:27:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 155. [2024-11-09 11:27:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 143 states have internal predecessors, (167), 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) [2024-11-09 11:27:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 183 transitions. [2024-11-09 11:27:15,380 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 183 transitions. Word has length 32 [2024-11-09 11:27:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:27:15,380 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 183 transitions. [2024-11-09 11:27:15,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:27:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 183 transitions. [2024-11-09 11:27:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 11:27:15,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:15,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:27:15,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 11:27:15,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-09 11:27:15,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:15,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1256664877, now seen corresponding path program 1 times [2024-11-09 11:27:15,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:15,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873920062] [2024-11-09 11:27:15,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:15,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:17,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:27:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:17,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:17,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:17,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873920062] [2024-11-09 11:27:17,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873920062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:27:17,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:27:17,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 11:27:17,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145008196] [2024-11-09 11:27:17,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:27:17,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 11:27:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:27:17,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 11:27:17,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 11:27:17,110 INFO L87 Difference]: Start difference. First operand 155 states and 183 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:27:17,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:27:17,328 INFO L93 Difference]: Finished difference Result 172 states and 203 transitions. [2024-11-09 11:27:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 11:27:17,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2024-11-09 11:27:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:27:17,331 INFO L225 Difference]: With dead ends: 172 [2024-11-09 11:27:17,332 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 11:27:17,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-09 11:27:17,333 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 172 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 11:27:17,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 734 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 11:27:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 11:27:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 158. [2024-11-09 11:27:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 111 states have (on average 1.5495495495495495) internal successors, (172), 146 states have internal predecessors, (172), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 11:27:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 188 transitions. [2024-11-09 11:27:17,341 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 188 transitions. Word has length 32 [2024-11-09 11:27:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:27:17,342 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 188 transitions. [2024-11-09 11:27:17,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 11:27:17,343 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 188 transitions. [2024-11-09 11:27:17,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 11:27:17,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:17,347 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:27:17,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 11:27:17,347 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-09 11:27:17,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash -471179120, now seen corresponding path program 1 times [2024-11-09 11:27:17,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:17,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196148287] [2024-11-09 11:27:17,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:17,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:18,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:27:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 11:27:18,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:18,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196148287] [2024-11-09 11:27:18,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196148287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 11:27:18,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 11:27:18,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 11:27:18,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361870824] [2024-11-09 11:27:18,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 11:27:18,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 11:27:18,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 11:27:18,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 11:27:18,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:27:18,519 INFO L87 Difference]: Start difference. First operand 158 states and 188 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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) [2024-11-09 11:27:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 11:27:18,604 INFO L93 Difference]: Finished difference Result 274 states and 323 transitions. [2024-11-09 11:27:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 11:27:18,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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 36 [2024-11-09 11:27:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 11:27:18,606 INFO L225 Difference]: With dead ends: 274 [2024-11-09 11:27:18,606 INFO L226 Difference]: Without dead ends: 163 [2024-11-09 11:27:18,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 11:27:18,607 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 10 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 11:27:18,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 618 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 11:27:18,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-09 11:27:18,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2024-11-09 11:27:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 113 states have (on average 1.5398230088495575) internal successors, (174), 148 states have internal predecessors, (174), 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) [2024-11-09 11:27:18,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 190 transitions. [2024-11-09 11:27:18,616 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 190 transitions. Word has length 36 [2024-11-09 11:27:18,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 11:27:18,617 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 190 transitions. [2024-11-09 11:27:18,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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) [2024-11-09 11:27:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 190 transitions. [2024-11-09 11:27:18,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 11:27:18,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 11:27:18,619 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 11:27:18,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 11:27:18,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-09 11:27:18,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 11:27:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash -421308986, now seen corresponding path program 1 times [2024-11-09 11:27:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 11:27:18,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174803886] [2024-11-09 11:27:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:18,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 11:27:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:20,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 11:27:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 11:27:20,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 11:27:20,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174803886] [2024-11-09 11:27:20,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174803886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 11:27:20,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422872870] [2024-11-09 11:27:20,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 11:27:20,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 11:27:20,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 11:27:20,389 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) [2024-11-09 11:27:20,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 11:27:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 11:27:21,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 11:27:21,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 11:27:21,443 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 [2024-11-09 11:27:29,911 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 329 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 11:27:33,929 WARN L851 $PredicateComparison]: unable to prove that (and (= 9 |c_~#smp_def_rrlen_arr~0.base|) (let ((.cse1 (select |c_#memory_int#2| 9))) (= (store (store (store (store (store (store (store (store (store (store (let ((.cse11 (+ 340 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse10 (+ |c_~#smp_def_rrlen_arr~0.offset| 272))) (store (store (store (store (store (store (store (store (let ((.cse9 (+ |c_~#smp_def_rrlen_arr~0.offset| 240))) (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse8 (+ |c_~#smp_def_rrlen_arr~0.offset| 188))) (store (let ((.cse7 (+ |c_~#smp_def_rrlen_arr~0.offset| 184))) (store (let ((.cse6 (+ |c_~#smp_def_rrlen_arr~0.offset| 180))) (store (store (store (store (store (let ((.cse5 (+ 160 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse4 (+ |c_~#smp_def_rrlen_arr~0.offset| 108))) (store (store (let ((.cse3 (+ |c_~#smp_def_rrlen_arr~0.offset| 100))) (store (let ((.cse2 (+ |c_~#smp_def_rrlen_arr~0.offset| 96))) (store (store (store (store (store (store (store (store (store (store (store (let ((.cse0 (+ |c_~#smp_def_rrlen_arr~0.offset| 52))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store ((as const (Array Int Int)) 0) |c_~#smp_def_rrlen_arr~0.offset| 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 4) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 8) 6) (+ |c_~#smp_def_rrlen_arr~0.offset| 12) 1) (+ |c_~#smp_def_rrlen_arr~0.offset| 16) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 20) 14) (+ |c_~#smp_def_rrlen_arr~0.offset| 24) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 28) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 32) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 36) 3) (+ 40 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 44) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 48) 4) .cse0 (select .cse1 .cse0))) (+ 56 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 60) 5) (+ |c_~#smp_def_rrlen_arr~0.offset| 64) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 68) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 72) 6) (+ 76 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 80) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 84) 7) (+ 88 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ 92 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) .cse2 (select .cse1 .cse2))) .cse3 (select .cse1 .cse3))) (+ |c_~#smp_def_rrlen_arr~0.offset| 104) 12) .cse4 (select .cse1 .cse4))) (+ 112 |c_~#smp_def_rrlen_arr~0.offset|) 2) (+ 116 |c_~#smp_def_rrlen_arr~0.offset|) 6) (+ |c_~#smp_def_rrlen_arr~0.offset| 120) 18) (+ |c_~#smp_def_rrlen_arr~0.offset| 124) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 128) 13) (+ |c_~#smp_def_rrlen_arr~0.offset| 132) 19) (+ |c_~#smp_def_rrlen_arr~0.offset| 136) 2) (+ 140 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 144) 20) (+ |c_~#smp_def_rrlen_arr~0.offset| 148) (- 2)) (+ 152 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 156) 32) .cse5 (select .cse1 .cse5))) (+ |c_~#smp_def_rrlen_arr~0.offset| 164) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 168) 33) (+ |c_~#smp_def_rrlen_arr~0.offset| 172) (- 2)) (+ 176 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) .cse6 (select .cse1 .cse6))) .cse7 (select .cse1 .cse7))) .cse8 (select .cse1 .cse8))) (+ 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) (+ |c_~#smp_def_rrlen_arr~0.offset| 204) 129) (+ |c_~#smp_def_rrlen_arr~0.offset| 208) (- 2)) (+ 212 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 216) 130) (+ |c_~#smp_def_rrlen_arr~0.offset| 220) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 224) (- 3)) (+ 228 |c_~#smp_def_rrlen_arr~0.offset|) 131) (+ 232 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 236) (- 3)) .cse9 (select .cse1 .cse9))) (+ |c_~#smp_def_rrlen_arr~0.offset| 244) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 248) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 252) 134) (+ |c_~#smp_def_rrlen_arr~0.offset| 256) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 260) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 264) 135) (+ |c_~#smp_def_rrlen_arr~0.offset| 268) (- 2)) .cse10 (select .cse1 .cse10))) (+ 276 |c_~#smp_def_rrlen_arr~0.offset|) 136) (+ |c_~#smp_def_rrlen_arr~0.offset| 280) (- 2)) (+ 284 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 288) 137) (+ |c_~#smp_def_rrlen_arr~0.offset| 292) (- 2)) (+ 296 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 300) 138) (+ |c_~#smp_def_rrlen_arr~0.offset| 304) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 308) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 312) 139) (+ 316 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 320) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 324) 144) (+ |c_~#smp_def_rrlen_arr~0.offset| 328) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 332) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 336) 145) .cse11 (select .cse1 .cse11))) (+ |c_~#smp_def_rrlen_arr~0.offset| 344) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 348) 146) (+ 352 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ 356 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 360) 147) (+ |c_~#smp_def_rrlen_arr~0.offset| 364) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 368) 0) (+ 372 |c_~#smp_def_rrlen_arr~0.offset|) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 376) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 380) (- 1)) .cse1))) is different from false [2024-11-09 11:27:37,949 WARN L873 $PredicateComparison]: unable to prove that (and (= 9 |c_~#smp_def_rrlen_arr~0.base|) (let ((.cse1 (select |c_#memory_int#2| 9))) (= (store (store (store (store (store (store (store (store (store (store (let ((.cse11 (+ 340 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse10 (+ |c_~#smp_def_rrlen_arr~0.offset| 272))) (store (store (store (store (store (store (store (store (let ((.cse9 (+ |c_~#smp_def_rrlen_arr~0.offset| 240))) (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse8 (+ |c_~#smp_def_rrlen_arr~0.offset| 188))) (store (let ((.cse7 (+ |c_~#smp_def_rrlen_arr~0.offset| 184))) (store (let ((.cse6 (+ |c_~#smp_def_rrlen_arr~0.offset| 180))) (store (store (store (store (store (let ((.cse5 (+ 160 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse4 (+ |c_~#smp_def_rrlen_arr~0.offset| 108))) (store (store (let ((.cse3 (+ |c_~#smp_def_rrlen_arr~0.offset| 100))) (store (let ((.cse2 (+ |c_~#smp_def_rrlen_arr~0.offset| 96))) (store (store (store (store (store (store (store (store (store (store (store (let ((.cse0 (+ |c_~#smp_def_rrlen_arr~0.offset| 52))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store ((as const (Array Int Int)) 0) |c_~#smp_def_rrlen_arr~0.offset| 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 4) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 8) 6) (+ |c_~#smp_def_rrlen_arr~0.offset| 12) 1) (+ |c_~#smp_def_rrlen_arr~0.offset| 16) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 20) 14) (+ |c_~#smp_def_rrlen_arr~0.offset| 24) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 28) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 32) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 36) 3) (+ 40 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 44) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 48) 4) .cse0 (select .cse1 .cse0))) (+ 56 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 60) 5) (+ |c_~#smp_def_rrlen_arr~0.offset| 64) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 68) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 72) 6) (+ 76 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 80) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 84) 7) (+ 88 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ 92 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) .cse2 (select .cse1 .cse2))) .cse3 (select .cse1 .cse3))) (+ |c_~#smp_def_rrlen_arr~0.offset| 104) 12) .cse4 (select .cse1 .cse4))) (+ 112 |c_~#smp_def_rrlen_arr~0.offset|) 2) (+ 116 |c_~#smp_def_rrlen_arr~0.offset|) 6) (+ |c_~#smp_def_rrlen_arr~0.offset| 120) 18) (+ |c_~#smp_def_rrlen_arr~0.offset| 124) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 128) 13) (+ |c_~#smp_def_rrlen_arr~0.offset| 132) 19) (+ |c_~#smp_def_rrlen_arr~0.offset| 136) 2) (+ 140 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 144) 20) (+ |c_~#smp_def_rrlen_arr~0.offset| 148) (- 2)) (+ 152 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 156) 32) .cse5 (select .cse1 .cse5))) (+ |c_~#smp_def_rrlen_arr~0.offset| 164) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 168) 33) (+ |c_~#smp_def_rrlen_arr~0.offset| 172) (- 2)) (+ 176 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) .cse6 (select .cse1 .cse6))) .cse7 (select .cse1 .cse7))) .cse8 (select .cse1 .cse8))) (+ 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) (+ |c_~#smp_def_rrlen_arr~0.offset| 204) 129) (+ |c_~#smp_def_rrlen_arr~0.offset| 208) (- 2)) (+ 212 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 216) 130) (+ |c_~#smp_def_rrlen_arr~0.offset| 220) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 224) (- 3)) (+ 228 |c_~#smp_def_rrlen_arr~0.offset|) 131) (+ 232 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 236) (- 3)) .cse9 (select .cse1 .cse9))) (+ |c_~#smp_def_rrlen_arr~0.offset| 244) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 248) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 252) 134) (+ |c_~#smp_def_rrlen_arr~0.offset| 256) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 260) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 264) 135) (+ |c_~#smp_def_rrlen_arr~0.offset| 268) (- 2)) .cse10 (select .cse1 .cse10))) (+ 276 |c_~#smp_def_rrlen_arr~0.offset|) 136) (+ |c_~#smp_def_rrlen_arr~0.offset| 280) (- 2)) (+ 284 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 288) 137) (+ |c_~#smp_def_rrlen_arr~0.offset| 292) (- 2)) (+ 296 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 300) 138) (+ |c_~#smp_def_rrlen_arr~0.offset| 304) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 308) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 312) 139) (+ 316 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 320) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 324) 144) (+ |c_~#smp_def_rrlen_arr~0.offset| 328) 9) (+ |c_~#smp_def_rrlen_arr~0.offset| 332) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 336) 145) .cse11 (select .cse1 .cse11))) (+ |c_~#smp_def_rrlen_arr~0.offset| 344) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 348) 146) (+ 352 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ 356 |c_~#smp_def_rrlen_arr~0.offset|) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 360) 147) (+ |c_~#smp_def_rrlen_arr~0.offset| 364) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 368) 0) (+ 372 |c_~#smp_def_rrlen_arr~0.offset|) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 376) (- 1)) (+ |c_~#smp_def_rrlen_arr~0.offset| 380) (- 1)) .cse1))) is different from true [2024-11-09 11:27:45,997 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 329 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 11:27:54,019 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) [2024-11-09 11:28:02,065 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 329 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 11:28:10,087 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) [2024-11-09 11:28:18,128 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 329 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 11:28:26,147 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) [2024-11-09 11:28:34,183 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 329 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 11:28:42,208 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)