./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 023d838f 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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:53:17,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:53:17,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:53:17,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:53:17,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:53:17,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:53:17,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:53:17,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:53:17,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:53:17,447 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:53:17,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:53:17,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:53:17,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:53:17,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:53:17,451 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:53:17,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:53:17,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:53:17,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:53:17,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:53:17,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:53:17,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:53:17,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:53:17,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:53:17,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:53:17,457 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:53:17,457 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:53:17,457 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:53:17,458 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:53:17,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:53:17,458 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:53:17,458 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:53:17,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:53:17,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:53:17,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:53:17,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:53:17,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:53:17,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:53:17,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:53:17,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:53:17,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:53:17,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:53:17,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:53:17,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:53:17,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:53:17,464 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-10 18:53:17,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:53:17,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:53:17,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:53:17,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:53:17,765 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:53:17,766 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-10 18:53:19,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:53:19,610 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:53:19,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/discover_list.c [2024-11-10 18:53:19,629 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b5ba0e5/01949a2734554086bdd54ae141f1e7a4/FLAG556b69cf5 [2024-11-10 18:53:19,646 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57b5ba0e5/01949a2734554086bdd54ae141f1e7a4 [2024-11-10 18:53:19,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:53:19,650 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:53:19,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:53:19,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:53:19,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:53:19,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:53:19" (1/1) ... [2024-11-10 18:53:19,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7703ae89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:19, skipping insertion in model container [2024-11-10 18:53:19,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:53:19" (1/1) ... [2024-11-10 18:53:19,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:53:20,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:53:20,089 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:53:20,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:53:20,210 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:53:20,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:20 WrapperNode [2024-11-10 18:53:20,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:53:20,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:53:20,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:53:20,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:53:20,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:20" (1/1) ... [2024-11-10 18:53:20,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:20" (1/1) ... [2024-11-10 18:53:20,281 INFO L138 Inliner]: procedures = 37, calls = 249, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 572 [2024-11-10 18:53:20,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:53:20,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:53:20,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:53:20,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:53:20,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:20" (1/1) ... [2024-11-10 18:53:20,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:20" (1/1) ... [2024-11-10 18:53:20,299 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:20" (1/1) ... [2024-11-10 18:53:20,334 INFO L175 MemorySlicer]: Split 181 memory accesses to 7 slices as follows [2, 100, 4, 11, 12, 42, 10]. 55 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 148 writes are split as follows [0, 97, 1, 11, 0, 39, 0]. [2024-11-10 18:53:20,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:20" (1/1) ... [2024-11-10 18:53:20,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:20" (1/1) ... [2024-11-10 18:53:20,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:20" (1/1) ... [2024-11-10 18:53:20,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:20" (1/1) ... [2024-11-10 18:53:20,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:20" (1/1) ... [2024-11-10 18:53:20,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:20" (1/1) ... [2024-11-10 18:53:20,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:53:20,396 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:53:20,399 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:53:20,399 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:53:20,400 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:20" (1/1) ... [2024-11-10 18:53:20,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:53:20,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:53:20,438 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-10 18:53:20,447 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-10 18:53:20,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:53:20,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-11-10 18:53:20,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-11-10 18:53:20,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-11-10 18:53:20,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-11-10 18:53:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-11-10 18:53:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2024-11-10 18:53:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2024-11-10 18:53:20,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 18:53:20,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 18:53:20,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 18:53:20,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 18:53:20,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 18:53:20,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 18:53:20,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 18:53:20,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 18:53:20,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 18:53:20,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 18:53:20,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 18:53:20,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 18:53:20,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 18:53:20,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 18:53:20,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 18:53:20,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 18:53:20,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 18:53:20,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-10 18:53:20,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2024-11-10 18:53:20,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2024-11-10 18:53:20,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2024-11-10 18:53:20,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2024-11-10 18:53:20,502 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 18:53:20,502 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 18:53:20,503 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-10 18:53:20,503 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2024-11-10 18:53:20,503 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2024-11-10 18:53:20,503 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2024-11-10 18:53:20,503 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2024-11-10 18:53:20,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:53:20,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 18:53:20,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 18:53:20,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 18:53:20,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 18:53:20,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 18:53:20,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 18:53:20,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 18:53:20,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:53:20,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:53:20,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 18:53:20,505 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 18:53:20,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 18:53:20,687 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:53:20,691 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:53:21,605 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: call ULTIMATE.dealloc(do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset);havoc do_discover_list_~#smp_req~0#1.base, do_discover_list_~#smp_req~0#1.offset;call ULTIMATE.dealloc(do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset);havoc do_discover_list_~#smp_rr~0#1.base, do_discover_list_~#smp_rr~0#1.offset; [2024-11-10 18:53:21,606 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L108: havoc smp_send_req_#t~nondet4#1; [2024-11-10 18:53:21,606 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L489: havoc do_discover_list_#t~mem105#1; [2024-11-10 18:53:21,606 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: havoc do_discover_list_#t~mem100#1; [2024-11-10 18:53:21,606 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L495: call ULTIMATE.dealloc(main_~#tobj~0#1.base, main_~#tobj~0#1.offset);havoc main_~#tobj~0#1.base, main_~#tobj~0#1.offset;call ULTIMATE.dealloc(main_~#opts~0#1.base, main_~#opts~0#1.offset);havoc main_~#opts~0#1.base, main_~#opts~0#1.offset; [2024-11-10 18:53:21,700 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2024-11-10 18:53:21,701 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:53:21,736 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:53:21,737 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:53:21,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:53:21 BoogieIcfgContainer [2024-11-10 18:53:21,737 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:53:21,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:53:21,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:53:21,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:53:21,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:53:19" (1/3) ... [2024-11-10 18:53:21,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77691199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:53:21, skipping insertion in model container [2024-11-10 18:53:21,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:53:20" (2/3) ... [2024-11-10 18:53:21,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77691199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:53:21, skipping insertion in model container [2024-11-10 18:53:21,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:53:21" (3/3) ... [2024-11-10 18:53:21,748 INFO L112 eAbstractionObserver]: Analyzing ICFG discover_list.c [2024-11-10 18:53:21,764 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:53:21,764 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-11-10 18:53:21,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:53:21,851 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;@3c806e15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:53:21,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-11-10 18:53:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 178 states have internal predecessors, (219), 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-10 18:53:21,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 18:53:21,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:53:21,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 18:53:21,865 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-10 18:53:21,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:53:21,870 INFO L85 PathProgramCache]: Analyzing trace with hash 313756, now seen corresponding path program 1 times [2024-11-10 18:53:21,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:53:21,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581834010] [2024-11-10 18:53:21,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:53:21,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:53:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:23,596 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-10 18:53:23,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:53:23,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581834010] [2024-11-10 18:53:23,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581834010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:53:23,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:53:23,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:53:23,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523202282] [2024-11-10 18:53:23,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:53:23,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:53:23,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:53:23,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:53:23,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:53:23,622 INFO L87 Difference]: Start difference. First operand has 190 states, 136 states have (on average 1.6102941176470589) internal successors, (219), 178 states have internal predecessors, (219), 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-10 18:53:23,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:53:23,703 INFO L93 Difference]: Finished difference Result 360 states and 450 transitions. [2024-11-10 18:53:23,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:53:23,706 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-10 18:53:23,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:53:23,715 INFO L225 Difference]: With dead ends: 360 [2024-11-10 18:53:23,715 INFO L226 Difference]: Without dead ends: 169 [2024-11-10 18:53:23,719 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-10 18:53:23,724 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 4 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:53:23,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 438 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:53:23,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-10 18:53:23,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-10 18:53:23,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 120 states have (on average 1.5083333333333333) internal successors, (181), 157 states have internal predecessors, (181), 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-10 18:53:23,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2024-11-10 18:53:23,774 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 3 [2024-11-10 18:53:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:53:23,774 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2024-11-10 18:53:23,775 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-10 18:53:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2024-11-10 18:53:23,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 18:53:23,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:53:23,776 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-10 18:53:23,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:53:23,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-10 18:53:23,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:53:23,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1628062622, now seen corresponding path program 1 times [2024-11-10 18:53:23,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:53:23,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796788166] [2024-11-10 18:53:23,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:53:23,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:53:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:24,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:53:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:24,998 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-10 18:53:24,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:53:25,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796788166] [2024-11-10 18:53:25,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796788166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:53:25,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:53:25,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:53:25,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100002336] [2024-11-10 18:53:25,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:53:25,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:53:25,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:53:25,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:53:25,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:53:25,006 INFO L87 Difference]: Start difference. First operand 169 states and 197 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-10 18:53:25,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:53:25,197 INFO L93 Difference]: Finished difference Result 179 states and 210 transitions. [2024-11-10 18:53:25,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:53:25,198 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-10 18:53:25,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:53:25,201 INFO L225 Difference]: With dead ends: 179 [2024-11-10 18:53:25,203 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 18:53:25,204 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-10 18:53:25,205 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 31 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:53:25,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 640 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:53:25,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 18:53:25,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2024-11-10 18:53:25,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 124 states have (on average 1.4758064516129032) internal successors, (183), 159 states have internal predecessors, (183), 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-10 18:53:25,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 199 transitions. [2024-11-10 18:53:25,228 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 199 transitions. Word has length 27 [2024-11-10 18:53:25,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:53:25,229 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 199 transitions. [2024-11-10 18:53:25,229 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-10 18:53:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 199 transitions. [2024-11-10 18:53:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 18:53:25,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:53:25,232 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, 1] [2024-11-10 18:53:25,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:53:25,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-10 18:53:25,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:53:25,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1809657320, now seen corresponding path program 1 times [2024-11-10 18:53:25,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:53:25,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610400947] [2024-11-10 18:53:25,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:53:25,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:53:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:27,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:53:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:27,777 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-10 18:53:27,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:53:27,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610400947] [2024-11-10 18:53:27,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610400947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:53:27,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:53:27,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:53:27,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898311754] [2024-11-10 18:53:27,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:53:27,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:53:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:53:27,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:53:27,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:53:27,784 INFO L87 Difference]: Start difference. First operand 171 states and 199 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:53:27,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:53:27,991 INFO L93 Difference]: Finished difference Result 311 states and 360 transitions. [2024-11-10 18:53:27,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:53:27,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-11-10 18:53:27,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:53:27,994 INFO L225 Difference]: With dead ends: 311 [2024-11-10 18:53:27,994 INFO L226 Difference]: Without dead ends: 177 [2024-11-10 18:53:27,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:53:27,998 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 186 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:53:27,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 677 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:53:27,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-10 18:53:28,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2024-11-10 18:53:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 126 states have (on average 1.4682539682539681) internal successors, (185), 161 states have internal predecessors, (185), 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-10 18:53:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 201 transitions. [2024-11-10 18:53:28,010 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 201 transitions. Word has length 33 [2024-11-10 18:53:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:53:28,010 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 201 transitions. [2024-11-10 18:53:28,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:53:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2024-11-10 18:53:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 18:53:28,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:53:28,011 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, 1] [2024-11-10 18:53:28,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:53:28,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-10 18:53:28,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:53:28,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1869686185, now seen corresponding path program 1 times [2024-11-10 18:53:28,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:53:28,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293442377] [2024-11-10 18:53:28,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:53:28,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:53:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:28,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:53:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:28,847 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-10 18:53:28,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:53:28,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293442377] [2024-11-10 18:53:28,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293442377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:53:28,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:53:28,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:53:28,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137600272] [2024-11-10 18:53:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:53:28,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:53:28,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:53:28,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:53:28,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:53:28,851 INFO L87 Difference]: Start difference. First operand 173 states and 201 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:53:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:53:28,940 INFO L93 Difference]: Finished difference Result 183 states and 212 transitions. [2024-11-10 18:53:28,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:53:28,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-11-10 18:53:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:53:28,942 INFO L225 Difference]: With dead ends: 183 [2024-11-10 18:53:28,942 INFO L226 Difference]: Without dead ends: 181 [2024-11-10 18:53:28,943 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-10 18:53:28,944 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 13 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:53:28,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 518 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:53:28,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-10 18:53:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 173. [2024-11-10 18:53:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 126 states have (on average 1.4682539682539681) internal successors, (185), 161 states have internal predecessors, (185), 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-10 18:53:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 201 transitions. [2024-11-10 18:53:28,954 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 201 transitions. Word has length 33 [2024-11-10 18:53:28,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:53:28,955 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 201 transitions. [2024-11-10 18:53:28,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:53:28,955 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2024-11-10 18:53:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 18:53:28,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:53:28,956 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, 1] [2024-11-10 18:53:28,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:53:28,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-10 18:53:28,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:53:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1869687146, now seen corresponding path program 1 times [2024-11-10 18:53:28,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:53:28,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037123266] [2024-11-10 18:53:28,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:53:28,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:53:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:31,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:53:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:31,430 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-10 18:53:31,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:53:31,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037123266] [2024-11-10 18:53:31,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037123266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:53:31,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:53:31,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:53:31,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235139487] [2024-11-10 18:53:31,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:53:31,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:53:31,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:53:31,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:53:31,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:53:31,434 INFO L87 Difference]: Start difference. First operand 173 states and 201 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:53:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:53:31,725 INFO L93 Difference]: Finished difference Result 315 states and 363 transitions. [2024-11-10 18:53:31,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:53:31,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2024-11-10 18:53:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:53:31,728 INFO L225 Difference]: With dead ends: 315 [2024-11-10 18:53:31,728 INFO L226 Difference]: Without dead ends: 184 [2024-11-10 18:53:31,730 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-10 18:53:31,731 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 189 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:53:31,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 832 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:53:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-10 18:53:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 176. [2024-11-10 18:53:31,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 129 states have (on average 1.4651162790697674) internal successors, (189), 164 states have internal predecessors, (189), 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-10 18:53:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 205 transitions. [2024-11-10 18:53:31,752 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 205 transitions. Word has length 33 [2024-11-10 18:53:31,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:53:31,753 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 205 transitions. [2024-11-10 18:53:31,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:53:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 205 transitions. [2024-11-10 18:53:31,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 18:53:31,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:53:31,755 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-10 18:53:31,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:53:31,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-10 18:53:31,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:53:31,757 INFO L85 PathProgramCache]: Analyzing trace with hash -38133423, now seen corresponding path program 1 times [2024-11-10 18:53:31,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:53:31,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102485385] [2024-11-10 18:53:31,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:53:31,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:53:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:32,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:53:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:32,652 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-10 18:53:32,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:53:32,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102485385] [2024-11-10 18:53:32,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102485385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:53:32,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:53:32,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:53:32,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146294935] [2024-11-10 18:53:32,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:53:32,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:53:32,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:53:32,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:53:32,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:53:32,655 INFO L87 Difference]: Start difference. First operand 176 states and 205 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-10 18:53:32,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:53:32,750 INFO L93 Difference]: Finished difference Result 312 states and 360 transitions. [2024-11-10 18:53:32,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:53:32,751 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-10 18:53:32,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:53:32,754 INFO L225 Difference]: With dead ends: 312 [2024-11-10 18:53:32,754 INFO L226 Difference]: Without dead ends: 181 [2024-11-10 18:53:32,755 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-10 18:53:32,755 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 10 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:53:32,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 690 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:53:32,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-10 18:53:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2024-11-10 18:53:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 131 states have (on average 1.4580152671755726) internal successors, (191), 166 states have internal predecessors, (191), 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-10 18:53:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 207 transitions. [2024-11-10 18:53:32,772 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 207 transitions. Word has length 36 [2024-11-10 18:53:32,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:53:32,774 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 207 transitions. [2024-11-10 18:53:32,774 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-10 18:53:32,774 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 207 transitions. [2024-11-10 18:53:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 18:53:32,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:53:32,777 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-10 18:53:32,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:53:32,778 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2024-11-10 18:53:32,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:53:32,778 INFO L85 PathProgramCache]: Analyzing trace with hash 21895442, now seen corresponding path program 1 times [2024-11-10 18:53:32,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:53:32,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113510137] [2024-11-10 18:53:32,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:53:32,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:53:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:34,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-10 18:53:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:35,000 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-10 18:53:35,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:53:35,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113510137] [2024-11-10 18:53:35,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113510137] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:53:35,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877904935] [2024-11-10 18:53:35,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:53:35,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:53:35,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:53:35,003 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-10 18:53:35,004 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-10 18:53:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:53:36,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 18:53:36,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:53:36,168 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-10 18:53:44,667 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 328 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 18:53:52,697 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 18:53:56,724 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select |c_#memory_int#1| 9))) (= (store (store (store (store (store (let ((.cse8 (+ |c_~#smp_def_rrlen_arr~0.offset| 360))) (store (store (store (store (store (store (store (store (let ((.cse7 (+ |c_~#smp_def_rrlen_arr~0.offset| 328))) (store (store (store (store (store (let ((.cse6 (+ |c_~#smp_def_rrlen_arr~0.offset| 308))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse5 (+ |c_~#smp_def_rrlen_arr~0.offset| 236))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse4 (+ 76 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (let ((.cse3 (+ |c_~#smp_def_rrlen_arr~0.offset| 48))) (store (let ((.cse2 (+ |c_~#smp_def_rrlen_arr~0.offset| 44))) (store (store (let ((.cse0 (+ |c_~#smp_def_rrlen_arr~0.offset| 36))) (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)) .cse0 (select .cse1 .cse0))) (+ 40 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) .cse2 (select .cse1 .cse2))) .cse3 (select .cse1 .cse3))) (+ |c_~#smp_def_rrlen_arr~0.offset| 52) (- 2)) (+ 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) .cse4 (select .cse1 .cse4))) (+ |c_~#smp_def_rrlen_arr~0.offset| 80) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 84) 7) (+ 88 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ 92 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 96) 16) (+ |c_~#smp_def_rrlen_arr~0.offset| 100) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 104) 12) (+ |c_~#smp_def_rrlen_arr~0.offset| 108) 17) (+ 112 |c_~#smp_def_rrlen_arr~0.offset|) 2) (+ 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) (+ 160 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 164) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 168) 33) (+ |c_~#smp_def_rrlen_arr~0.offset| 172) (- 2)) (+ 176 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 180) 34) (+ |c_~#smp_def_rrlen_arr~0.offset| 184) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 188) (- 2)) (+ 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)) .cse5 (select .cse1 .cse5))) (+ |c_~#smp_def_rrlen_arr~0.offset| 240) 133) (+ |c_~#smp_def_rrlen_arr~0.offset| 244) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 248) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 252) 134) (+ |c_~#smp_def_rrlen_arr~0.offset| 256) (- 2)) (+ |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)) (+ |c_~#smp_def_rrlen_arr~0.offset| 272) 0) (+ 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)) .cse6 (select .cse1 .cse6))) (+ |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) .cse7 (select .cse1 .cse7))) (+ |c_~#smp_def_rrlen_arr~0.offset| 332) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 336) 145) (+ 340 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ |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) .cse8 (select .cse1 .cse8))) (+ |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)) (= 9 |c_~#smp_def_rrlen_arr~0.base|)) is different from false [2024-11-10 18:54:00,742 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select |c_#memory_int#1| 9))) (= (store (store (store (store (store (let ((.cse8 (+ |c_~#smp_def_rrlen_arr~0.offset| 360))) (store (store (store (store (store (store (store (store (let ((.cse7 (+ |c_~#smp_def_rrlen_arr~0.offset| 328))) (store (store (store (store (store (let ((.cse6 (+ |c_~#smp_def_rrlen_arr~0.offset| 308))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse5 (+ |c_~#smp_def_rrlen_arr~0.offset| 236))) (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (store (let ((.cse4 (+ 76 |c_~#smp_def_rrlen_arr~0.offset|))) (store (store (store (store (store (store (store (let ((.cse3 (+ |c_~#smp_def_rrlen_arr~0.offset| 48))) (store (let ((.cse2 (+ |c_~#smp_def_rrlen_arr~0.offset| 44))) (store (store (let ((.cse0 (+ |c_~#smp_def_rrlen_arr~0.offset| 36))) (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)) .cse0 (select .cse1 .cse0))) (+ 40 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) .cse2 (select .cse1 .cse2))) .cse3 (select .cse1 .cse3))) (+ |c_~#smp_def_rrlen_arr~0.offset| 52) (- 2)) (+ 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) .cse4 (select .cse1 .cse4))) (+ |c_~#smp_def_rrlen_arr~0.offset| 80) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 84) 7) (+ 88 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ 92 |c_~#smp_def_rrlen_arr~0.offset|) (- 3)) (+ |c_~#smp_def_rrlen_arr~0.offset| 96) 16) (+ |c_~#smp_def_rrlen_arr~0.offset| 100) 2) (+ |c_~#smp_def_rrlen_arr~0.offset| 104) 12) (+ |c_~#smp_def_rrlen_arr~0.offset| 108) 17) (+ 112 |c_~#smp_def_rrlen_arr~0.offset|) 2) (+ 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) (+ 160 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 164) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 168) 33) (+ |c_~#smp_def_rrlen_arr~0.offset| 172) (- 2)) (+ 176 |c_~#smp_def_rrlen_arr~0.offset|) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 180) 34) (+ |c_~#smp_def_rrlen_arr~0.offset| 184) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 188) (- 2)) (+ 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)) .cse5 (select .cse1 .cse5))) (+ |c_~#smp_def_rrlen_arr~0.offset| 240) 133) (+ |c_~#smp_def_rrlen_arr~0.offset| 244) (- 2)) (+ |c_~#smp_def_rrlen_arr~0.offset| 248) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 252) 134) (+ |c_~#smp_def_rrlen_arr~0.offset| 256) (- 2)) (+ |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)) (+ |c_~#smp_def_rrlen_arr~0.offset| 272) 0) (+ 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)) .cse6 (select .cse1 .cse6))) (+ |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) .cse7 (select .cse1 .cse7))) (+ |c_~#smp_def_rrlen_arr~0.offset| 332) 0) (+ |c_~#smp_def_rrlen_arr~0.offset| 336) 145) (+ 340 |c_~#smp_def_rrlen_arr~0.offset|) 9) (+ |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) .cse8 (select .cse1 .cse8))) (+ |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)) (= 9 |c_~#smp_def_rrlen_arr~0.base|)) is different from true [2024-11-10 18:54:08,775 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-10 18:54:16,803 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 328 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 18:54:24,837 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-10 18:54:32,861 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 328 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 18:54:40,893 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-10 18:54:48,921 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 328 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)