./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB --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 e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:16:58,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:16:58,489 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-28 03:16:58,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:16:58,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:16:58,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:16:58,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:16:58,530 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:16:58,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:16:58,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:16:58,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:16:58,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:16:58,531 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:16:58,532 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:16:58,532 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:16:58,532 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:16:58,532 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:16:58,532 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:16:58,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:16:58,533 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:16:58,533 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:16:58,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:16:58,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:16:58,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:16:58,533 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-28 03:16:58,533 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:16:58,534 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:16:58,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:16:58,534 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:16:58,534 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:16:58,534 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:16:58,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:16:58,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:16:58,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:16:58,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:16:58,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:16:58,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:16:58,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:16:58,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:16:58,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:16:58,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:16:58,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:16:58,536 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:16:58,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:16:58,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:16:58,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:16:58,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:16:58,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:16:58,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:16:58,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:16:58,537 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2024-11-28 03:16:58,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:16:58,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:16:58,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:16:58,957 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:16:58,957 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:16:58,960 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-28 03:17:02,562 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/data/8edde2d19/db9d08f7cc814841821f825d0ed52867/FLAG484870135 [2024-11-28 03:17:02,954 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:17:02,955 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-28 03:17:02,974 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/data/8edde2d19/db9d08f7cc814841821f825d0ed52867/FLAG484870135 [2024-11-28 03:17:02,996 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/data/8edde2d19/db9d08f7cc814841821f825d0ed52867 [2024-11-28 03:17:02,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:17:03,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:17:03,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:17:03,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:17:03,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:17:03,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:02" (1/1) ... [2024-11-28 03:17:03,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c878ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03, skipping insertion in model container [2024-11-28 03:17:03,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:02" (1/1) ... [2024-11-28 03:17:03,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:17:03,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:17:03,402 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:17:03,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:17:03,500 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:17:03,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03 WrapperNode [2024-11-28 03:17:03,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:17:03,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:17:03,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:17:03,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:17:03,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03" (1/1) ... [2024-11-28 03:17:03,531 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03" (1/1) ... [2024-11-28 03:17:03,558 INFO L138 Inliner]: procedures = 127, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 110 [2024-11-28 03:17:03,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:17:03,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:17:03,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:17:03,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:17:03,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03" (1/1) ... [2024-11-28 03:17:03,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03" (1/1) ... [2024-11-28 03:17:03,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03" (1/1) ... [2024-11-28 03:17:03,610 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2024-11-28 03:17:03,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03" (1/1) ... [2024-11-28 03:17:03,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03" (1/1) ... [2024-11-28 03:17:03,623 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03" (1/1) ... [2024-11-28 03:17:03,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03" (1/1) ... [2024-11-28 03:17:03,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03" (1/1) ... [2024-11-28 03:17:03,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03" (1/1) ... [2024-11-28 03:17:03,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03" (1/1) ... [2024-11-28 03:17:03,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:17:03,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:17:03,644 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:17:03,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:17:03,645 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03" (1/1) ... [2024-11-28 03:17:03,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:17:03,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:03,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:17:03,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:17:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:17:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 03:17:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 03:17:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:17:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 03:17:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 03:17:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-28 03:17:03,727 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-28 03:17:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:17:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:17:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:17:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:17:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:17:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 03:17:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:17:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:17:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 03:17:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:17:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 03:17:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 03:17:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 03:17:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:17:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:17:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 03:17:03,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:17:03,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:17:03,897 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:17:03,899 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:17:04,131 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-28 03:17:04,131 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:17:04,140 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:17:04,141 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 03:17:04,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:04 BoogieIcfgContainer [2024-11-28 03:17:04,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:17:04,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:17:04,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:17:04,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:17:04,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:17:02" (1/3) ... [2024-11-28 03:17:04,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b3e671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:17:04, skipping insertion in model container [2024-11-28 03:17:04,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:03" (2/3) ... [2024-11-28 03:17:04,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78b3e671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:17:04, skipping insertion in model container [2024-11-28 03:17:04,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:04" (3/3) ... [2024-11-28 03:17:04,154 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2024-11-28 03:17:04,171 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:17:04,173 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_equal.i that has 2 procedures, 41 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2024-11-28 03:17:04,228 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:17:04,241 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;@74db65bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:17:04,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-28 03:17:04,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 37 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:17:04,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:17:04,252 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:04,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:04,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:17:04,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1210174752, now seen corresponding path program 1 times [2024-11-28 03:17:04,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:04,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671781039] [2024-11-28 03:17:04,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:04,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:04,871 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-28 03:17:04,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:04,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671781039] [2024-11-28 03:17:04,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671781039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:04,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:04,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:17:04,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171310480] [2024-11-28 03:17:04,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:04,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:17:04,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:04,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:17:04,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:17:04,916 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 37 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-28 03:17:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:05,013 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2024-11-28 03:17:05,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:17:05,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2024-11-28 03:17:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:05,023 INFO L225 Difference]: With dead ends: 78 [2024-11-28 03:17:05,023 INFO L226 Difference]: Without dead ends: 35 [2024-11-28 03:17:05,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-28 03:17:05,031 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:05,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 114 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:17:05,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-28 03:17:05,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-11-28 03:17:05,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:17:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-28 03:17:05,077 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 11 [2024-11-28 03:17:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:05,079 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-28 03:17:05,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-28 03:17:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-28 03:17:05,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 03:17:05,081 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:05,081 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:05,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:17:05,082 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:17:05,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:05,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1139288399, now seen corresponding path program 1 times [2024-11-28 03:17:05,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:05,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380167730] [2024-11-28 03:17:05,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:05,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:05,285 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-28 03:17:05,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:05,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380167730] [2024-11-28 03:17:05,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380167730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:05,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:05,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:17:05,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147306532] [2024-11-28 03:17:05,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:05,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:17:05,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:05,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:17:05,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:17:05,289 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-28 03:17:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:05,353 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2024-11-28 03:17:05,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:17:05,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2024-11-28 03:17:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:05,355 INFO L225 Difference]: With dead ends: 36 [2024-11-28 03:17:05,355 INFO L226 Difference]: Without dead ends: 35 [2024-11-28 03:17:05,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-28 03:17:05,356 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:05,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:17:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-28 03:17:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-28 03:17:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:17:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-28 03:17:05,364 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 12 [2024-11-28 03:17:05,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:05,367 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-28 03:17:05,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-28 03:17:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-28 03:17:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-28 03:17:05,368 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:05,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-28 03:17:05,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:17:05,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:17:05,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:05,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2101150733, now seen corresponding path program 1 times [2024-11-28 03:17:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:05,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415494824] [2024-11-28 03:17:05,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:05,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 03:17:05,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:05,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415494824] [2024-11-28 03:17:05,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415494824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:05,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:05,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:17:05,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032803182] [2024-11-28 03:17:05,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:05,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:17:05,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:05,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:17:05,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:17:05,577 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:17:05,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:05,626 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-28 03:17:05,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:17:05,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-11-28 03:17:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:05,629 INFO L225 Difference]: With dead ends: 35 [2024-11-28 03:17:05,629 INFO L226 Difference]: Without dead ends: 34 [2024-11-28 03:17:05,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-28 03:17:05,631 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:05,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 72 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:17:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-28 03:17:05,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-28 03:17:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.24) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:17:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-28 03:17:05,638 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 21 [2024-11-28 03:17:05,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:05,638 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-28 03:17:05,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:17:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-28 03:17:05,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-28 03:17:05,639 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:05,639 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-28 03:17:05,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:17:05,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:17:05,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:05,645 INFO L85 PathProgramCache]: Analyzing trace with hash -711163236, now seen corresponding path program 1 times [2024-11-28 03:17:05,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731382916] [2024-11-28 03:17:05,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:05,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 03:17:06,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:06,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731382916] [2024-11-28 03:17:06,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731382916] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:06,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94257060] [2024-11-28 03:17:06,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:06,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:06,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:06,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:06,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:17:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:06,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 03:17:06,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 03:17:06,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:17:06,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94257060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:06,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:17:06,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-28 03:17:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195967857] [2024-11-28 03:17:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:06,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:17:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:06,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:17:06,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:17:06,376 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:17:06,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:06,444 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2024-11-28 03:17:06,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:17:06,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-28 03:17:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:06,447 INFO L225 Difference]: With dead ends: 34 [2024-11-28 03:17:06,447 INFO L226 Difference]: Without dead ends: 33 [2024-11-28 03:17:06,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:17:06,451 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:06,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:17:06,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-28 03:17:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2024-11-28 03:17:06,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:17:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-11-28 03:17:06,466 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2024-11-28 03:17:06,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:06,466 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-28 03:17:06,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:17:06,467 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-11-28 03:17:06,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 03:17:06,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:06,468 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:06,477 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:17:06,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-28 03:17:06,669 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:17:06,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:06,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1280927047, now seen corresponding path program 1 times [2024-11-28 03:17:06,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:06,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706370238] [2024-11-28 03:17:06,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:06,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 03:17:06,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:06,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706370238] [2024-11-28 03:17:06,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706370238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:06,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417136406] [2024-11-28 03:17:06,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:06,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:06,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:06,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:06,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:17:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:07,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 03:17:07,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:07,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 03:17:07,244 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:17:07,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417136406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:07,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:17:07,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2024-11-28 03:17:07,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334528033] [2024-11-28 03:17:07,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:07,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:07,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:07,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:07,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:17:07,250 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:17:07,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:07,263 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-11-28 03:17:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:07,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-28 03:17:07,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:07,265 INFO L225 Difference]: With dead ends: 29 [2024-11-28 03:17:07,265 INFO L226 Difference]: Without dead ends: 28 [2024-11-28 03:17:07,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:17:07,266 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:07,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 34 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:17:07,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-28 03:17:07,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-28 03:17:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:17:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-28 03:17:07,281 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2024-11-28 03:17:07,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:07,282 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-28 03:17:07,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:17:07,282 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-28 03:17:07,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 03:17:07,283 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:07,284 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:07,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:17:07,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:07,485 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:17:07,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:07,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1054032876, now seen corresponding path program 1 times [2024-11-28 03:17:07,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:07,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561205385] [2024-11-28 03:17:07,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:07,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 03:17:07,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:07,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561205385] [2024-11-28 03:17:07,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561205385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:07,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586894282] [2024-11-28 03:17:07,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:07,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:07,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:07,696 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:07,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:17:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:07,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 03:17:07,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 03:17:07,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:17:07,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586894282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:07,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:17:07,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2024-11-28 03:17:07,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983829272] [2024-11-28 03:17:07,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:07,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:17:07,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:07,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:17:07,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:17:07,944 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:17:07,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:07,951 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-28 03:17:07,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:17:07,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-28 03:17:07,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:07,952 INFO L225 Difference]: With dead ends: 28 [2024-11-28 03:17:07,953 INFO L226 Difference]: Without dead ends: 25 [2024-11-28 03:17:07,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:17:07,954 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:07,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 34 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:17:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-28 03:17:07,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-28 03:17:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:17:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-28 03:17:07,961 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 26 [2024-11-28 03:17:07,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:07,962 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-28 03:17:07,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:17:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-11-28 03:17:07,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 03:17:07,963 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:07,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:07,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:17:08,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:08,167 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:17:08,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:08,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1684792515, now seen corresponding path program 1 times [2024-11-28 03:17:08,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:08,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130629800] [2024-11-28 03:17:08,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:08,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 03:17:08,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:08,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130629800] [2024-11-28 03:17:08,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130629800] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:08,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752731749] [2024-11-28 03:17:08,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:08,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:08,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:08,381 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:08,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:17:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:08,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 03:17:08,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:17:08,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:17:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 03:17:08,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752731749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:17:08,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:17:08,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-28 03:17:08,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424462517] [2024-11-28 03:17:08,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:17:08,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:17:08,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:08,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:17:08,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:17:08,765 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 03:17:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:08,825 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2024-11-28 03:17:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:17:08,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-11-28 03:17:08,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:08,830 INFO L225 Difference]: With dead ends: 47 [2024-11-28 03:17:08,830 INFO L226 Difference]: Without dead ends: 30 [2024-11-28 03:17:08,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:17:08,832 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:08,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:17:08,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-28 03:17:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-28 03:17:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:17:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-28 03:17:08,839 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 27 [2024-11-28 03:17:08,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:08,839 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-28 03:17:08,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 03:17:08,840 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-28 03:17:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-28 03:17:08,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:08,841 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:08,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:17:09,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:09,044 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:17:09,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:09,045 INFO L85 PathProgramCache]: Analyzing trace with hash 2053267024, now seen corresponding path program 2 times [2024-11-28 03:17:09,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:09,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837400136] [2024-11-28 03:17:09,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:17:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:09,086 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:17:09,086 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:17:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:17:09,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:09,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837400136] [2024-11-28 03:17:09,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837400136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:09,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:17:09,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:17:09,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564619047] [2024-11-28 03:17:09,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:09,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:17:09,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:09,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:17:09,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:17:09,160 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:17:09,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:09,188 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-11-28 03:17:09,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:17:09,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-28 03:17:09,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:09,190 INFO L225 Difference]: With dead ends: 37 [2024-11-28 03:17:09,190 INFO L226 Difference]: Without dead ends: 35 [2024-11-28 03:17:09,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-28 03:17:09,191 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:09,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:17:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-28 03:17:09,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-28 03:17:09,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:17:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-28 03:17:09,199 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 37 [2024-11-28 03:17:09,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:09,200 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-28 03:17:09,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:17:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-28 03:17:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-28 03:17:09,201 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:09,201 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:09,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:17:09,202 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:17:09,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:09,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1489455646, now seen corresponding path program 1 times [2024-11-28 03:17:09,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:09,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113929837] [2024-11-28 03:17:09,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:09,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:17:09,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:09,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113929837] [2024-11-28 03:17:09,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113929837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:09,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674887446] [2024-11-28 03:17:09,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:09,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:09,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:09,464 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:09,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:17:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:09,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:17:09,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:17:09,797 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:17:09,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674887446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:17:09,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 03:17:09,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-28 03:17:09,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459618991] [2024-11-28 03:17:09,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:17:09,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:17:09,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:09,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:17:09,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:17:09,801 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:17:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:09,839 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-11-28 03:17:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:17:09,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2024-11-28 03:17:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:09,844 INFO L225 Difference]: With dead ends: 35 [2024-11-28 03:17:09,844 INFO L226 Difference]: Without dead ends: 34 [2024-11-28 03:17:09,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:17:09,846 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:09,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:17:09,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-28 03:17:09,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-28 03:17:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:17:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-28 03:17:09,855 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 42 [2024-11-28 03:17:09,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:09,855 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-28 03:17:09,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:17:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-28 03:17:09,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 03:17:09,863 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:09,863 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:09,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-28 03:17:10,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:10,067 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:17:10,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:10,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1071515306, now seen corresponding path program 1 times [2024-11-28 03:17:10,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:10,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413169454] [2024-11-28 03:17:10,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:10,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:17:10,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:10,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413169454] [2024-11-28 03:17:10,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413169454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:10,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567634175] [2024-11-28 03:17:10,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:17:10,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:10,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:10,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:10,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:17:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:17:10,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:17:10,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:17:10,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:17:10,691 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:17:10,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567634175] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:17:10,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:17:10,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-28 03:17:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071287486] [2024-11-28 03:17:10,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:17:10,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:17:10,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:10,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:17:10,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:17:10,694 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:17:10,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:10,754 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2024-11-28 03:17:10,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:17:10,755 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-11-28 03:17:10,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:10,756 INFO L225 Difference]: With dead ends: 50 [2024-11-28 03:17:10,756 INFO L226 Difference]: Without dead ends: 49 [2024-11-28 03:17:10,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:17:10,758 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:10,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:17:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-28 03:17:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-28 03:17:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:17:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-11-28 03:17:10,766 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 43 [2024-11-28 03:17:10,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:10,766 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-11-28 03:17:10,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:17:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-28 03:17:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-28 03:17:10,767 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:10,768 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:10,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 03:17:10,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:10,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:17:10,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:10,973 INFO L85 PathProgramCache]: Analyzing trace with hash 767260028, now seen corresponding path program 2 times [2024-11-28 03:17:10,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:10,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251865926] [2024-11-28 03:17:10,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:17:10,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:11,022 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:17:11,023 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:17:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:17:11,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:11,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251865926] [2024-11-28 03:17:11,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251865926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:11,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609909861] [2024-11-28 03:17:11,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:17:11,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:11,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:11,438 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:11,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:17:11,694 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:17:11,694 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:17:11,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 03:17:11,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:17:11,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:17:12,108 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:17:12,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609909861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:17:12,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:17:12,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2024-11-28 03:17:12,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128991852] [2024-11-28 03:17:12,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:17:12,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 03:17:12,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:12,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 03:17:12,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-11-28 03:17:12,113 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:17:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:12,221 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2024-11-28 03:17:12,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-28 03:17:12,222 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2024-11-28 03:17:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:12,223 INFO L225 Difference]: With dead ends: 80 [2024-11-28 03:17:12,223 INFO L226 Difference]: Without dead ends: 79 [2024-11-28 03:17:12,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-11-28 03:17:12,225 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:12,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:17:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-28 03:17:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-28 03:17:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:17:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-11-28 03:17:12,241 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 58 [2024-11-28 03:17:12,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:12,242 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-11-28 03:17:12,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.130434782608696) internal successors, (72), 24 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:17:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-11-28 03:17:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-28 03:17:12,243 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:12,243 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:12,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 03:17:12,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:12,451 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:17:12,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash 458849212, now seen corresponding path program 3 times [2024-11-28 03:17:12,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:12,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903087209] [2024-11-28 03:17:12,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:17:12,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:12,596 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-28 03:17:12,596 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:17:13,693 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:17:13,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:13,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903087209] [2024-11-28 03:17:13,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903087209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:13,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479417385] [2024-11-28 03:17:13,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:17:13,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:13,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:13,697 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:13,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:17:15,429 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-28 03:17:15,430 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:17:15,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 03:17:15,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:17:15,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:17:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:17:16,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479417385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:17:16,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:17:16,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 47 [2024-11-28 03:17:16,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023688165] [2024-11-28 03:17:16,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:17:16,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-28 03:17:16,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:17:16,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-28 03:17:16,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2024-11-28 03:17:16,686 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 48 states, 47 states have (on average 2.8085106382978724) internal successors, (132), 48 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:17:16,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:17:16,886 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2024-11-28 03:17:16,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-28 03:17:16,887 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.8085106382978724) internal successors, (132), 48 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-11-28 03:17:16,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:17:16,888 INFO L225 Difference]: With dead ends: 140 [2024-11-28 03:17:16,889 INFO L226 Difference]: Without dead ends: 139 [2024-11-28 03:17:16,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2024-11-28 03:17:16,892 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:17:16,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:17:16,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-28 03:17:16,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-28 03:17:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0149253731343284) internal successors, (136), 134 states have internal predecessors, (136), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:17:16,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2024-11-28 03:17:16,920 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 88 [2024-11-28 03:17:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:17:16,922 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2024-11-28 03:17:16,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.8085106382978724) internal successors, (132), 48 states have internal predecessors, (132), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:17:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2024-11-28 03:17:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-28 03:17:16,925 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:17:16,925 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:17:16,941 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-28 03:17:17,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-28 03:17:17,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:17:17,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:17:17,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1797535804, now seen corresponding path program 4 times [2024-11-28 03:17:17,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:17:17,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339361456] [2024-11-28 03:17:17,128 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:17:17,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:17:17,264 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:17:17,264 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:17:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1287 backedges. 322 proven. 33 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2024-11-28 03:17:21,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:17:21,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339361456] [2024-11-28 03:17:21,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339361456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:17:21,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628819542] [2024-11-28 03:17:21,913 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:17:21,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:17:21,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:17:21,916 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:17:21,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-28 03:17:22,308 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:17:22,308 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:17:22,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-28 03:17:22,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:17:22,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-28 03:17:22,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:17:22,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:17:22,883 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_2| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_2| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)) |c_#memory_$Pointer$#1.base|) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse0)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_22| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_22| |c_#memory_$Pointer$#1.offset|))) (and (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_22| .cse1 (select |c_#memory_$Pointer$#1.offset| .cse1))) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))))) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (store |v_#valid_BEFORE_CALL_2| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from false [2024-11-28 03:17:22,891 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_2| |c_#memory_$Pointer$#1.base|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_2| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)) |c_#memory_$Pointer$#1.base|) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.base| .cse0)))) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) (or (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (exists ((|v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_22| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_22| |c_#memory_$Pointer$#1.offset|))) (and (= .cse1 |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) (= |c_#memory_$Pointer$#1.offset| (store |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_22| .cse1 (select |c_#memory_$Pointer$#1.offset| .cse1))) (= (select (select |v_old(#memory_$Pointer$#1.offset)_AFTER_CALL_22| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))))) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_2| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (store |v_#valid_BEFORE_CALL_2| .cse2 (select |c_#valid| .cse2)))))) (= |c_ULTIMATE.start_sll_create_#t~ret4#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#t~ret4#1.base|) 1)) is different from true [2024-11-28 03:17:23,016 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-28 03:17:23,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 03:17:23,071 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-28 03:17:23,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2024-11-28 03:17:23,103 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= 1 (select |v_#valid_BEFORE_CALL_2| .cse0)) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (store |v_#valid_BEFORE_CALL_2| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2024-11-28 03:17:23,107 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_2| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= 1 (select |v_#valid_BEFORE_CALL_2| .cse0)) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (store |v_#valid_BEFORE_CALL_2| .cse1 (select |c_#valid| .cse1)))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from true [2024-11-28 03:17:23,311 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_2| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (store |v_#valid_BEFORE_CALL_2| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_2| .cse0) 1))) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|)))) is different from false [2024-11-28 03:17:23,315 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_2| |c_ULTIMATE.start_sll_create_#res#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (store |v_#valid_BEFORE_CALL_2| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_2| .cse0) 1))) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 |c_ULTIMATE.start_sll_create_#res#1.base|)))) is different from true [2024-11-28 03:17:23,423 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |c_#valid| .cse1) 1) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_2| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (store |v_#valid_BEFORE_CALL_2| .cse2 (select |c_#valid| .cse2))))))))) is different from false [2024-11-28 03:17:23,427 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| .cse1) 4))) (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select |c_#valid| .cse1) 1) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse0) 4) 0) (= .cse0 .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (exists ((|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_2| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse1) 0) (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_2| |c_#valid|))) (store |v_#valid_BEFORE_CALL_2| .cse2 (select |c_#valid| .cse2))))))))) is different from true [2024-11-28 03:17:23,464 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 03:17:23,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2024-11-28 03:17:23,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:17:23,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-28 03:17:23,536 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse0) 0) (= |v_#valid_BEFORE_CALL_3| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse1 (select |v_#valid_BEFORE_CALL_3| .cse1)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-28 03:17:23,540 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse0) 0) (= |v_#valid_BEFORE_CALL_3| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse1 (select |v_#valid_BEFORE_CALL_3| .cse1)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-28 03:17:23,600 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse0) 0) (= |v_#valid_BEFORE_CALL_3| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse1 (select |v_#valid_BEFORE_CALL_3| .cse1)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2024-11-28 03:17:23,604 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse0) 0) (= |v_#valid_BEFORE_CALL_3| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse1 (select |v_#valid_BEFORE_CALL_3| .cse1)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2024-11-28 03:17:23,709 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse0) 0) (= |v_#valid_BEFORE_CALL_3| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse1 (select |v_#valid_BEFORE_CALL_3| .cse1)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from false [2024-11-28 03:17:23,714 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse0) 0) (= |v_#valid_BEFORE_CALL_3| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse1 (select |v_#valid_BEFORE_CALL_3| .cse1)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_#res#1.base|))) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_#res#1.base|)))) is different from true [2024-11-28 03:17:23,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:17:23,840 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 03:17:23,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2024-11-28 03:17:23,908 INFO L349 Elim1Store]: treesize reduction 48, result has 56.8 percent of original size [2024-11-28 03:17:23,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 73 [2024-11-28 03:17:24,071 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse0) 0) (= |v_#valid_BEFORE_CALL_3| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse1 (select |v_#valid_BEFORE_CALL_3| .cse1)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse3 (select |v_#valid_BEFORE_CALL_4| .cse3))) |v_#valid_BEFORE_CALL_4|) (= (select |v_#valid_BEFORE_CALL_5| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_4| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse2) 0))) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 4) 0) (= .cse4 .cse2)) (let ((.cse5 (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) (or (and .cse5 (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0)) (and (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse5)))))) is different from false [2024-11-28 03:17:24,078 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse0) 0) (= |v_#valid_BEFORE_CALL_3| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse1 (select |v_#valid_BEFORE_CALL_3| .cse1)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse2) 1) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse3 (select |v_#valid_BEFORE_CALL_4| .cse3))) |v_#valid_BEFORE_CALL_4|) (= (select |v_#valid_BEFORE_CALL_5| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_4| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse2) 0))) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (or (= (select (select |c_#memory_$Pointer$#1.base| .cse4) 4) 0) (= .cse4 .cse2)) (let ((.cse5 (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse4) 4) 0) (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) (or (and .cse5 (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0)) (and (= .cse2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) .cse5)))))) is different from true [2024-11-28 03:17:24,484 INFO L349 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2024-11-28 03:17:24,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 206 treesize of output 177 [2024-11-28 03:17:24,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:17:24,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:17:24,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:17:24,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2024-11-28 03:17:24,667 INFO L349 Elim1Store]: treesize reduction 52, result has 40.2 percent of original size [2024-11-28 03:17:24,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 59 [2024-11-28 03:17:24,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:17:24,758 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-28 03:17:24,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 77 [2024-11-28 03:17:33,370 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (let ((.cse8 (= (select (select |c_#memory_$Pointer$#1.offset| .cse13) 4) 0)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse13) 4)) (.cse10 (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0)) (.cse0 (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse65 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse65) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse65) 0) (= |v_#valid_BEFORE_CALL_3| (let ((.cse66 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse66 (select |v_#valid_BEFORE_CALL_3| .cse66)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))))) (or (and .cse0 (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int) (|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (let ((.cse3 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select |v_#valid_BEFORE_CALL_5| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_4| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_4| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse4 (select |v_#valid_BEFORE_CALL_4| .cse4))) |v_#valid_BEFORE_CALL_4|) (= (select |v_#valid_BEFORE_CALL_5| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (= .cse2 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0))))))) (and .cse8 (= .cse9 0) .cse10 (or (and .cse0 (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int) (|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (let ((.cse11 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_4| .cse11) 0) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse12 (select |v_#valid_BEFORE_CALL_4| .cse12))) |v_#valid_BEFORE_CALL_4|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse11) 4) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse13) 1) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse6) 0))))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int) (|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_4| (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|)) 0) (= (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse14 (select |v_#valid_BEFORE_CALL_4| .cse14))) |v_#valid_BEFORE_CALL_4|) (= (select |v_#valid_BEFORE_CALL_5| .cse13) 1) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse6) 0)))) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (and (= (select |v_#valid_BEFORE_CALL_4| (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|)) 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse15) 1) (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|)) (= (select |v_#valid_BEFORE_CALL_2| .cse15) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse16 (select |v_#valid_BEFORE_CALL_3| .cse16)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1))) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0))) (= (select |v_#valid_BEFORE_CALL_4| .cse6) 1) (= (let ((.cse17 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse17 (select |v_#valid_BEFORE_CALL_4| .cse17))) |v_#valid_BEFORE_CALL_4|))) (= (select |v_#valid_BEFORE_CALL_5| .cse13) 1) (= (select |v_#valid_BEFORE_CALL_5| .cse6) 0))) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse6) 1) (= (let ((.cse18 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse18 (select |v_#valid_BEFORE_CALL_4| .cse18))) |v_#valid_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (let ((.cse19 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse19) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse19) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse20 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= .cse20 (select (select |c_#memory_$Pointer$#1.base| .cse19) 4)) (= (select |v_#valid_BEFORE_CALL_3| .cse20) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse20) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse21 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse21 (select |v_#valid_BEFORE_CALL_3| .cse21)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1)))))))) (= (select |v_#valid_BEFORE_CALL_5| .cse13) 1) (= (select |v_#valid_BEFORE_CALL_5| .cse6) 0))) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (let ((.cse22 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse22) 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse23) 1) (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|)) (= (select |v_#valid_BEFORE_CALL_2| .cse23) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse24 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse24 (select |v_#valid_BEFORE_CALL_3| .cse24)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse22) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0)))) (= (select |v_#valid_BEFORE_CALL_4| .cse6) 1) (= (let ((.cse25 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse25 (select |v_#valid_BEFORE_CALL_4| .cse25))) |v_#valid_BEFORE_CALL_4|))) (= (select |v_#valid_BEFORE_CALL_5| .cse13) 1) (= (select |v_#valid_BEFORE_CALL_5| .cse6) 0))) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_5| .cse13) 1) (exists ((|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse6) 1) (= (let ((.cse26 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse26 (select |v_#valid_BEFORE_CALL_4| .cse26))) |v_#valid_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (let ((.cse27 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse27) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse27) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse28 (select (select |c_#memory_$Pointer$#1.base| .cse27) 4))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse28) 1) (= |v_#valid_BEFORE_CALL_3| (let ((.cse29 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse29 (select |v_#valid_BEFORE_CALL_3| .cse29)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse28) 0))))))))) (= (select |v_#valid_BEFORE_CALL_5| .cse6) 0))))) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (let ((.cse30 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse30 (select |v_#valid_BEFORE_CALL_4| .cse30))) |v_#valid_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (let ((.cse33 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (let ((.cse32 (select (select |c_#memory_$Pointer$#1.base| .cse33) 4))) (let ((.cse31 (select (select |c_#memory_$Pointer$#1.base| .cse32) 4))) (and (= (select |v_#valid_BEFORE_CALL_5| .cse31) 1) (= (select |v_#valid_BEFORE_CALL_4| .cse32) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse31) 4) 0) (= (select |v_#valid_BEFORE_CALL_4| .cse33) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse33) 4) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse32) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse31) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (= .cse32 .cse6) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse32) 1) (= |v_#valid_BEFORE_CALL_3| (let ((.cse34 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse34 (select |v_#valid_BEFORE_CALL_3| .cse34)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse32) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse32) 4) 0)))))))) (and (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_4| .cse13) 1) (= (let ((.cse35 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse35 (select |v_#valid_BEFORE_CALL_4| .cse35))) |v_#valid_BEFORE_CALL_4|) (= (select |v_#valid_BEFORE_CALL_5| .cse13) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse9) 1))) .cse8 (= (select (select |c_#memory_$Pointer$#1.base| .cse9) 4) 0) (or (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse36 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse36) 1) (= .cse36 .cse13) (= (select |v_#valid_BEFORE_CALL_2| .cse36) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse37 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse37 (select |v_#valid_BEFORE_CALL_3| .cse37)))))))) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse38 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |v_#valid_BEFORE_CALL_3| .cse38) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse38) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse39 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse39 (select |v_#valid_BEFORE_CALL_3| .cse39)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1))) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse40 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse40) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse40) 0) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse41 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse41 (select |v_#valid_BEFORE_CALL_3| .cse41)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1))) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_2| .cse13) 0) (= (select |v_#valid_BEFORE_CALL_3| .cse13) 1) (= |v_#valid_BEFORE_CALL_3| (let ((.cse42 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse42 (select |v_#valid_BEFORE_CALL_3| .cse42)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 4) 0) .cse10) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (let ((.cse45 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (let ((.cse44 (select (select |c_#memory_$Pointer$#1.base| .cse45) 4))) (let ((.cse43 (select (select |c_#memory_$Pointer$#1.base| .cse44) 4))) (and (= (select |v_#valid_BEFORE_CALL_5| .cse43) 1) (= (select |v_#valid_BEFORE_CALL_4| .cse44) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse43) 4) 0) (= (select |v_#valid_BEFORE_CALL_4| .cse45) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse45) 4) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse44) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse43) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse46 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= .cse46 .cse44) (= (select |v_#valid_BEFORE_CALL_3| .cse46) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse46) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse47 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse47 (select |v_#valid_BEFORE_CALL_3| .cse47)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1))) (= .cse44 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse44) 4) 0)))))) (= (let ((.cse48 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse48 (select |v_#valid_BEFORE_CALL_4| .cse48))) |v_#valid_BEFORE_CALL_4|))) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (let ((.cse49 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse49 (select |v_#valid_BEFORE_CALL_4| .cse49))) |v_#valid_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (let ((.cse52 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (let ((.cse51 (select (select |c_#memory_$Pointer$#1.base| .cse52) 4))) (let ((.cse50 (select (select |c_#memory_$Pointer$#1.base| .cse51) 4))) (and (= (select |v_#valid_BEFORE_CALL_5| .cse50) 1) (= (select |v_#valid_BEFORE_CALL_4| .cse51) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse50) 4) 0) (= (select |v_#valid_BEFORE_CALL_4| .cse52) 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse53 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse53) 1) (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|)) (= (select |v_#valid_BEFORE_CALL_2| .cse53) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse54 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse54 (select |v_#valid_BEFORE_CALL_3| .cse54)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse52) 4) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse51) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse50) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (= .cse51 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse51) 4) 0)))))))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int) (|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (let ((.cse57 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (let ((.cse56 (select (select |c_#memory_$Pointer$#1.base| .cse57) 4))) (let ((.cse55 (select (select |c_#memory_$Pointer$#1.base| .cse56) 4))) (and (= (select |v_#valid_BEFORE_CALL_5| .cse55) 1) (= (select |v_#valid_BEFORE_CALL_4| .cse56) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse55) 4) 0) (= (select |v_#valid_BEFORE_CALL_4| .cse57) 0) (= (let ((.cse58 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse58 (select |v_#valid_BEFORE_CALL_4| .cse58))) |v_#valid_BEFORE_CALL_4|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse57) 4) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse56) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse55) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (= .cse56 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse56) 4) 0))))))) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (let ((.cse59 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse59 (select |v_#valid_BEFORE_CALL_4| .cse59))) |v_#valid_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (let ((.cse62 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (let ((.cse61 (select (select |c_#memory_$Pointer$#1.base| .cse62) 4))) (let ((.cse60 (select (select |c_#memory_$Pointer$#1.base| .cse61) 4))) (and (= (select |v_#valid_BEFORE_CALL_5| .cse60) 1) (= (select |v_#valid_BEFORE_CALL_4| .cse61) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse60) 4) 0) (= (select |v_#valid_BEFORE_CALL_4| .cse62) 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse63 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse63) 1) (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|)) (= (select |v_#valid_BEFORE_CALL_2| .cse63) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse64 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse64 (select |v_#valid_BEFORE_CALL_3| .cse64)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1))) (= (select |v_#valid_BEFORE_CALL_5| .cse61) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse60) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (= .cse61 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse61) 4) 0))))))))))))) (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2024-11-28 03:17:33,411 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| .cse6) 4))) (let ((.cse8 (= (select (select |c_#memory_$Pointer$#1.offset| .cse13) 4) 0)) (.cse9 (select (select |c_#memory_$Pointer$#1.base| .cse13) 4)) (.cse10 (= (select (select |c_#memory_$Pointer$#1.offset| .cse6) 4) 0)) (.cse0 (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int)) (|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse65 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse65) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse65) 0) (= |v_#valid_BEFORE_CALL_3| (let ((.cse66 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse66 (select |v_#valid_BEFORE_CALL_3| .cse66)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))))) (or (and .cse0 (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int) (|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (let ((.cse3 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| .cse2) 4))) (and (= (select |v_#valid_BEFORE_CALL_5| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_4| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) 4) 0) (= (select |v_#valid_BEFORE_CALL_4| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse4 (select |v_#valid_BEFORE_CALL_4| .cse4))) |v_#valid_BEFORE_CALL_4|) (= (select |v_#valid_BEFORE_CALL_5| .cse2) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (= .cse2 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse2) 4) 0))))))) (and .cse8 (= .cse9 0) .cse10 (or (and .cse0 (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int) (|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (let ((.cse11 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_4| .cse11) 0) (= (let ((.cse12 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse12 (select |v_#valid_BEFORE_CALL_4| .cse12))) |v_#valid_BEFORE_CALL_4|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse11) 4) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse13) 1) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse6) 0))))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int) (|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_4| (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|)) 0) (= (let ((.cse14 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse14 (select |v_#valid_BEFORE_CALL_4| .cse14))) |v_#valid_BEFORE_CALL_4|) (= (select |v_#valid_BEFORE_CALL_5| .cse13) 1) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse6) 0)))) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (and (= (select |v_#valid_BEFORE_CALL_4| (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|)) 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse15) 1) (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|)) (= (select |v_#valid_BEFORE_CALL_2| .cse15) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse16 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse16 (select |v_#valid_BEFORE_CALL_3| .cse16)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1))) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0))) (= (select |v_#valid_BEFORE_CALL_4| .cse6) 1) (= (let ((.cse17 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse17 (select |v_#valid_BEFORE_CALL_4| .cse17))) |v_#valid_BEFORE_CALL_4|))) (= (select |v_#valid_BEFORE_CALL_5| .cse13) 1) (= (select |v_#valid_BEFORE_CALL_5| .cse6) 0))) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse6) 1) (= (let ((.cse18 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse18 (select |v_#valid_BEFORE_CALL_4| .cse18))) |v_#valid_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (let ((.cse19 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse19) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse19) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse20 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= .cse20 (select (select |c_#memory_$Pointer$#1.base| .cse19) 4)) (= (select |v_#valid_BEFORE_CALL_3| .cse20) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse20) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse21 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse21 (select |v_#valid_BEFORE_CALL_3| .cse21)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1)))))))) (= (select |v_#valid_BEFORE_CALL_5| .cse13) 1) (= (select |v_#valid_BEFORE_CALL_5| .cse6) 0))) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (let ((.cse22 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse22) 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse23 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse23) 1) (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|)) (= (select |v_#valid_BEFORE_CALL_2| .cse23) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse24 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse24 (select |v_#valid_BEFORE_CALL_3| .cse24)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse22) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0)))) (= (select |v_#valid_BEFORE_CALL_4| .cse6) 1) (= (let ((.cse25 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse25 (select |v_#valid_BEFORE_CALL_4| .cse25))) |v_#valid_BEFORE_CALL_4|))) (= (select |v_#valid_BEFORE_CALL_5| .cse13) 1) (= (select |v_#valid_BEFORE_CALL_5| .cse6) 0))) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_5| .cse13) 1) (exists ((|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse6) 1) (= (let ((.cse26 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse26 (select |v_#valid_BEFORE_CALL_4| .cse26))) |v_#valid_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (let ((.cse27 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse27) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse27) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (let ((.cse28 (select (select |c_#memory_$Pointer$#1.base| .cse27) 4))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse28) 1) (= |v_#valid_BEFORE_CALL_3| (let ((.cse29 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse29 (select |v_#valid_BEFORE_CALL_3| .cse29)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse28) 0))))))))) (= (select |v_#valid_BEFORE_CALL_5| .cse6) 0))))) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (let ((.cse30 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse30 (select |v_#valid_BEFORE_CALL_4| .cse30))) |v_#valid_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (let ((.cse33 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (let ((.cse32 (select (select |c_#memory_$Pointer$#1.base| .cse33) 4))) (let ((.cse31 (select (select |c_#memory_$Pointer$#1.base| .cse32) 4))) (and (= (select |v_#valid_BEFORE_CALL_5| .cse31) 1) (= (select |v_#valid_BEFORE_CALL_4| .cse32) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse31) 4) 0) (= (select |v_#valid_BEFORE_CALL_4| .cse33) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse33) 4) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse32) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse31) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (= .cse32 .cse6) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse32) 1) (= |v_#valid_BEFORE_CALL_3| (let ((.cse34 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse34 (select |v_#valid_BEFORE_CALL_3| .cse34)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse32) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse32) 4) 0)))))))) (and (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_4| .cse6) 0) (= (select |v_#valid_BEFORE_CALL_4| .cse13) 1) (= (let ((.cse35 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse35 (select |v_#valid_BEFORE_CALL_4| .cse35))) |v_#valid_BEFORE_CALL_4|) (= (select |v_#valid_BEFORE_CALL_5| .cse13) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse9) 1))) .cse8 (= (select (select |c_#memory_$Pointer$#1.base| .cse9) 4) 0) (or (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1) (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse36 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse36) 1) (= .cse36 .cse13) (= (select |v_#valid_BEFORE_CALL_2| .cse36) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse37 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse37 (select |v_#valid_BEFORE_CALL_3| .cse37)))))))) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse38 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select |v_#valid_BEFORE_CALL_3| .cse38) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse38) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse39 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse39 (select |v_#valid_BEFORE_CALL_3| .cse39)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1))) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse40 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse40) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse40) 0) (not (= |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse41 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse41 (select |v_#valid_BEFORE_CALL_3| .cse41)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1))) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_3| (Array Int Int)) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_2| .cse13) 0) (= (select |v_#valid_BEFORE_CALL_3| .cse13) 1) (= |v_#valid_BEFORE_CALL_3| (let ((.cse42 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse42 (select |v_#valid_BEFORE_CALL_3| .cse42)))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 4) 0) .cse10) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (let ((.cse45 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (let ((.cse44 (select (select |c_#memory_$Pointer$#1.base| .cse45) 4))) (let ((.cse43 (select (select |c_#memory_$Pointer$#1.base| .cse44) 4))) (and (= (select |v_#valid_BEFORE_CALL_5| .cse43) 1) (= (select |v_#valid_BEFORE_CALL_4| .cse44) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse43) 4) 0) (= (select |v_#valid_BEFORE_CALL_4| .cse45) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse45) 4) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse44) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse43) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse46 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= .cse46 .cse44) (= (select |v_#valid_BEFORE_CALL_3| .cse46) 1) (= (select |v_#valid_BEFORE_CALL_2| .cse46) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse47 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse47 (select |v_#valid_BEFORE_CALL_3| .cse47)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1))) (= .cse44 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse44) 4) 0)))))) (= (let ((.cse48 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse48 (select |v_#valid_BEFORE_CALL_4| .cse48))) |v_#valid_BEFORE_CALL_4|))) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (let ((.cse49 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse49 (select |v_#valid_BEFORE_CALL_4| .cse49))) |v_#valid_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (let ((.cse52 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (let ((.cse51 (select (select |c_#memory_$Pointer$#1.base| .cse52) 4))) (let ((.cse50 (select (select |c_#memory_$Pointer$#1.base| .cse51) 4))) (and (= (select |v_#valid_BEFORE_CALL_5| .cse50) 1) (= (select |v_#valid_BEFORE_CALL_4| .cse51) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse50) 4) 0) (= (select |v_#valid_BEFORE_CALL_4| .cse52) 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse53 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse53) 1) (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|)) (= (select |v_#valid_BEFORE_CALL_2| .cse53) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse54 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse54 (select |v_#valid_BEFORE_CALL_3| .cse54)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse52) 4) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse51) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse50) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (= .cse51 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse51) 4) 0)))))))) (and .cse0 (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int) (|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (let ((.cse57 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (let ((.cse56 (select (select |c_#memory_$Pointer$#1.base| .cse57) 4))) (let ((.cse55 (select (select |c_#memory_$Pointer$#1.base| .cse56) 4))) (and (= (select |v_#valid_BEFORE_CALL_5| .cse55) 1) (= (select |v_#valid_BEFORE_CALL_4| .cse56) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse55) 4) 0) (= (select |v_#valid_BEFORE_CALL_4| .cse57) 0) (= (let ((.cse58 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse58 (select |v_#valid_BEFORE_CALL_4| .cse58))) |v_#valid_BEFORE_CALL_4|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse57) 4) 0) (= (select |v_#valid_BEFORE_CALL_5| .cse56) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse55) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (= .cse56 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse56) 4) 0))))))) (exists ((|v_#valid_BEFORE_CALL_5| (Array Int Int)) (|v_#valid_BEFORE_CALL_4| (Array Int Int))) (and (= (let ((.cse59 (@diff |v_#valid_BEFORE_CALL_5| |v_#valid_BEFORE_CALL_4|))) (store |v_#valid_BEFORE_CALL_5| .cse59 (select |v_#valid_BEFORE_CALL_4| .cse59))) |v_#valid_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.offset_10| Int)) (let ((.cse62 (select .cse7 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|))) (let ((.cse61 (select (select |c_#memory_$Pointer$#1.base| .cse62) 4))) (let ((.cse60 (select (select |c_#memory_$Pointer$#1.base| .cse61) 4))) (and (= (select |v_#valid_BEFORE_CALL_5| .cse60) 1) (= (select |v_#valid_BEFORE_CALL_4| .cse61) 1) (= (select (select |c_#memory_$Pointer$#1.base| .cse60) 4) 0) (= (select |v_#valid_BEFORE_CALL_4| .cse62) 0) (exists ((v_arrayElimIndex_1 Int) (|v_#valid_BEFORE_CALL_2| (Array Int Int))) (and (exists ((|v_#valid_BEFORE_CALL_3| (Array Int Int))) (and (exists ((|v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| Int)) (let ((.cse63 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|))) (and (= (select |v_#valid_BEFORE_CALL_3| .cse63) 1) (not (= |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1| |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|)) (= (select |v_#valid_BEFORE_CALL_2| .cse63) 0) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_sll_prepend_~head#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_1|) 0)))) (= |v_#valid_BEFORE_CALL_3| (let ((.cse64 (@diff |v_#valid_BEFORE_CALL_2| |v_#valid_BEFORE_CALL_3|))) (store |v_#valid_BEFORE_CALL_2| .cse64 (select |v_#valid_BEFORE_CALL_3| .cse64)))))) (= (select |v_#valid_BEFORE_CALL_2| v_arrayElimIndex_1) 1))) (= (select |v_#valid_BEFORE_CALL_5| .cse61) 0) (= (select (select |c_#memory_$Pointer$#1.offset| .cse60) 4) 0) (= (select .cse5 |v_ULTIMATE.start_sll_prepend_~head#1.offset_10|) 0) (= .cse61 .cse6) (= (select (select |c_#memory_$Pointer$#1.offset| .cse61) 4) 0))))))))))))) (= (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from true [2024-11-28 03:19:15,753 WARN L286 SmtUtils]: Spent 1.68m on a formula simplification that was a NOOP. DAG size: 1549 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 03:19:15,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:19:15,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 26 select indices, 26 select index equivalence classes, 0 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 325 case distinctions, treesize of input 2234 treesize of output 5278 [2024-11-28 03:19:17,700 INFO L224 Elim1Store]: Index analysis took 718 ms [2024-11-28 03:21:08,751 WARN L286 SmtUtils]: Spent 1.83m on a formula simplification that was a NOOP. DAG size: 1549 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-28 03:21:08,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:21:08,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 26 select indices, 26 select index equivalence classes, 0 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 325 case distinctions, treesize of input 1694 treesize of output 5178 [2024-11-28 03:24:33,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-28 03:24:33,843 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-28 03:24:33,844 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-28 03:24:33,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-28 03:24:34,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-28 03:24:34,045 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:590) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:728) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2024-11-28 03:24:34,052 INFO L158 Benchmark]: Toolchain (without parser) took 451051.30ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 92.6MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 999.1MB. Max. memory is 16.1GB. [2024-11-28 03:24:34,052 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 167.8MB. Free memory is still 103.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:34,052 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.95ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 75.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:24:34,052 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.90ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 73.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:24:34,053 INFO L158 Benchmark]: Boogie Preprocessor took 81.43ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 71.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:24:34,053 INFO L158 Benchmark]: RCFGBuilder took 497.90ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 55.3MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:24:34,053 INFO L158 Benchmark]: TraceAbstraction took 449907.55ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 54.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 965.6MB. Max. memory is 16.1GB. [2024-11-28 03:24:34,055 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 167.8MB. Free memory is still 103.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.95ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 75.3MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.90ms. Allocated memory is still 117.4MB. Free memory was 75.3MB in the beginning and 73.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 81.43ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 71.0MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 497.90ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 55.3MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 449907.55ms. Allocated memory was 117.4MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 54.9MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 965.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB --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 e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:24:36,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:24:36,642 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-11-28 03:24:36,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:24:36,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:24:36,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:24:36,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:24:36,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:24:36,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:24:36,703 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:24:36,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:24:36,705 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:24:36,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:24:36,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:24:36,706 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:24:36,706 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:24:36,706 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:24:36,706 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:24:36,707 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:24:36,707 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:24:36,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:24:36,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:24:36,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:24:36,707 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:24:36,707 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 03:24:36,708 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-28 03:24:36,708 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 03:24:36,708 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:24:36,708 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:24:36,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:24:36,708 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:24:36,709 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:24:36,709 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:24:36,709 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:24:36,709 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:24:36,709 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:24:36,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:24:36,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:24:36,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:24:36,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:24:36,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:24:36,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:24:36,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:24:36,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:24:36,711 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:24:36,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:24:36,711 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 03:24:36,712 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 03:24:36,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:24:36,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:24:36,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:24:36,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:24:36,712 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2024-11-28 03:24:37,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:24:37,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:24:37,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:24:37,070 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:24:37,071 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:24:37,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-28 03:24:40,029 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/data/ad0ae2450/45b1cbfb07bf4b43914e484edad6fe6c/FLAGcc1964e33 [2024-11-28 03:24:40,381 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:24:40,383 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2024-11-28 03:24:40,401 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/data/ad0ae2450/45b1cbfb07bf4b43914e484edad6fe6c/FLAGcc1964e33 [2024-11-28 03:24:40,423 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/data/ad0ae2450/45b1cbfb07bf4b43914e484edad6fe6c [2024-11-28 03:24:40,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:24:40,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:24:40,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:24:40,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:24:40,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:24:40,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:24:40" (1/1) ... [2024-11-28 03:24:40,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac140a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:40, skipping insertion in model container [2024-11-28 03:24:40,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:24:40" (1/1) ... [2024-11-28 03:24:40,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:24:40,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:24:40,900 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:24:40,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:24:41,011 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:24:41,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41 WrapperNode [2024-11-28 03:24:41,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:24:41,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:24:41,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:24:41,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:24:41,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41" (1/1) ... [2024-11-28 03:24:41,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41" (1/1) ... [2024-11-28 03:24:41,074 INFO L138 Inliner]: procedures = 130, calls = 31, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 111 [2024-11-28 03:24:41,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:24:41,078 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:24:41,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:24:41,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:24:41,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41" (1/1) ... [2024-11-28 03:24:41,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41" (1/1) ... [2024-11-28 03:24:41,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41" (1/1) ... [2024-11-28 03:24:41,125 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 7, 5]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2024-11-28 03:24:41,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41" (1/1) ... [2024-11-28 03:24:41,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41" (1/1) ... [2024-11-28 03:24:41,141 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41" (1/1) ... [2024-11-28 03:24:41,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41" (1/1) ... [2024-11-28 03:24:41,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41" (1/1) ... [2024-11-28 03:24:41,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41" (1/1) ... [2024-11-28 03:24:41,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41" (1/1) ... [2024-11-28 03:24:41,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:24:41,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:24:41,165 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:24:41,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:24:41,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41" (1/1) ... [2024-11-28 03:24:41,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:24:41,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:41,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:24:41,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:24:41,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-28 03:24:41,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-28 03:24:41,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-28 03:24:41,246 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-28 03:24:41,247 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-28 03:24:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:24:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:24:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 03:24:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:24:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:24:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 03:24:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:24:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:24:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 03:24:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:24:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-28 03:24:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-28 03:24:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-28 03:24:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 03:24:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 03:24:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 03:24:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 03:24:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-28 03:24:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-28 03:24:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:24:41,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:24:41,396 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:24:41,398 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:24:41,675 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2024-11-28 03:24:41,675 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:24:41,684 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:24:41,685 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-28 03:24:41,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:24:41 BoogieIcfgContainer [2024-11-28 03:24:41,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:24:41,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:24:41,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:24:41,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:24:41,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:24:40" (1/3) ... [2024-11-28 03:24:41,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f1cf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:24:41, skipping insertion in model container [2024-11-28 03:24:41,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:24:41" (2/3) ... [2024-11-28 03:24:41,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f1cf5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:24:41, skipping insertion in model container [2024-11-28 03:24:41,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:24:41" (3/3) ... [2024-11-28 03:24:41,695 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2024-11-28 03:24:41,710 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:24:41,712 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_prepend_equal.i that has 2 procedures, 41 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2024-11-28 03:24:41,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:24:41,797 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;@11161a29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:24:41,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-28 03:24:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 37 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:24:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:24:41,809 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:41,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:41,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:24:41,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:41,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1210174752, now seen corresponding path program 1 times [2024-11-28 03:24:41,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:41,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1065816924] [2024-11-28 03:24:41,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:41,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:41,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:41,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:41,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:24:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:41,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:24:41,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:42,075 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-28 03:24:42,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:42,076 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:42,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065816924] [2024-11-28 03:24:42,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065816924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:42,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:42,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:24:42,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241510443] [2024-11-28 03:24:42,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:42,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:24:42,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:42,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:24:42,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:24:42,110 INFO L87 Difference]: Start difference. First operand has 41 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 37 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-28 03:24:42,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:42,188 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2024-11-28 03:24:42,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:24:42,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 11 [2024-11-28 03:24:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:42,200 INFO L225 Difference]: With dead ends: 71 [2024-11-28 03:24:42,200 INFO L226 Difference]: Without dead ends: 27 [2024-11-28 03:24:42,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-28 03:24:42,209 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:42,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:24:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-28 03:24:42,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-28 03:24:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:24:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-11-28 03:24:42,246 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 11 [2024-11-28 03:24:42,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:42,247 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-11-28 03:24:42,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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-28 03:24:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-11-28 03:24:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 03:24:42,249 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:42,249 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:42,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 03:24:42,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:42,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:24:42,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:42,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1054032876, now seen corresponding path program 1 times [2024-11-28 03:24:42,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:42,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [936920317] [2024-11-28 03:24:42,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:42,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:42,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:42,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:42,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:24:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:42,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-28 03:24:42,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:42,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-28 03:24:42,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-28 03:24:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 03:24:42,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:42,859 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:42,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936920317] [2024-11-28 03:24:42,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936920317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:42,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:42,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:24:42,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760362511] [2024-11-28 03:24:42,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:42,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:24:42,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:42,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:24:42,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:24:42,862 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:24:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:43,153 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-28 03:24:43,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:24:43,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-28 03:24:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:43,155 INFO L225 Difference]: With dead ends: 32 [2024-11-28 03:24:43,155 INFO L226 Difference]: Without dead ends: 29 [2024-11-28 03:24:43,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:24:43,156 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:43,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 114 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:24:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-28 03:24:43,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-28 03:24:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:24:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-11-28 03:24:43,162 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 26 [2024-11-28 03:24:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:43,163 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-11-28 03:24:43,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:24:43,163 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-11-28 03:24:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-28 03:24:43,164 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:43,164 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:43,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:24:43,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:43,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:24:43,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:43,370 INFO L85 PathProgramCache]: Analyzing trace with hash -688960337, now seen corresponding path program 1 times [2024-11-28 03:24:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:43,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1549906499] [2024-11-28 03:24:43,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:43,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:43,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:43,373 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:43,375 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:24:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:43,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:24:43,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:43,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-28 03:24:43,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:43,584 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:43,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549906499] [2024-11-28 03:24:43,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549906499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:43,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:43,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:24:43,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588070743] [2024-11-28 03:24:43,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:43,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 03:24:43,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:43,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 03:24:43,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 03:24:43,586 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:24:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:43,621 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2024-11-28 03:24:43,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:24:43,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-28 03:24:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:43,622 INFO L225 Difference]: With dead ends: 33 [2024-11-28 03:24:43,623 INFO L226 Difference]: Without dead ends: 32 [2024-11-28 03:24:43,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-28 03:24:43,624 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:43,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:24:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-28 03:24:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-28 03:24:43,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:24:43,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-11-28 03:24:43,637 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2024-11-28 03:24:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:43,637 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-11-28 03:24:43,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:24:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-11-28 03:24:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 03:24:43,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:43,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:43,649 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:24:43,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:43,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:24:43,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:43,839 INFO L85 PathProgramCache]: Analyzing trace with hash 831373076, now seen corresponding path program 1 times [2024-11-28 03:24:43,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:43,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2074073050] [2024-11-28 03:24:43,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:43,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:43,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:43,844 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:43,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:24:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:43,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 03:24:43,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 03:24:44,044 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:24:44,044 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:44,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074073050] [2024-11-28 03:24:44,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074073050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:24:44,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:24:44,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:24:44,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848830923] [2024-11-28 03:24:44,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:24:44,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:24:44,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:44,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:24:44,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:24:44,047 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:24:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:44,053 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-28 03:24:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:24:44,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-28 03:24:44,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:44,055 INFO L225 Difference]: With dead ends: 32 [2024-11-28 03:24:44,055 INFO L226 Difference]: Without dead ends: 29 [2024-11-28 03:24:44,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 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-28 03:24:44,056 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:44,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:24:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-28 03:24:44,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-28 03:24:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-28 03:24:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-11-28 03:24:44,062 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 31 [2024-11-28 03:24:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:44,062 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-28 03:24:44,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:24:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-11-28 03:24:44,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-28 03:24:44,064 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:44,064 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:44,075 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:24:44,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:44,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:24:44,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:44,269 INFO L85 PathProgramCache]: Analyzing trace with hash 83336663, now seen corresponding path program 1 times [2024-11-28 03:24:44,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:44,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1166262290] [2024-11-28 03:24:44,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:24:44,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:44,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:44,272 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:44,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:24:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:24:44,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 03:24:44,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-28 03:24:44,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:24:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 03:24:44,608 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:44,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166262290] [2024-11-28 03:24:44,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166262290] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:24:44,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:24:44,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2024-11-28 03:24:44,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660652290] [2024-11-28 03:24:44,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:24:44,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:24:44,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:44,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:24:44,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:24:44,610 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 03:24:44,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:44,715 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-11-28 03:24:44,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:24:44,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2024-11-28 03:24:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:44,718 INFO L225 Difference]: With dead ends: 57 [2024-11-28 03:24:44,719 INFO L226 Difference]: Without dead ends: 36 [2024-11-28 03:24:44,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:24:44,720 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:44,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 80 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:24:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-28 03:24:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-28 03:24:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:24:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-28 03:24:44,729 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 33 [2024-11-28 03:24:44,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:44,730 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-28 03:24:44,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-28 03:24:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-28 03:24:44,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-28 03:24:44,731 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:44,731 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:44,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:24:44,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:44,935 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:24:44,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1071515306, now seen corresponding path program 2 times [2024-11-28 03:24:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:44,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [997333819] [2024-11-28 03:24:44,936 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:24:44,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:44,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:44,938 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:44,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:24:45,202 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:24:45,203 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:24:45,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-28 03:24:45,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:24:45,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:24:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:24:45,420 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:45,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997333819] [2024-11-28 03:24:45,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997333819] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:24:45,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:24:45,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-28 03:24:45,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363660831] [2024-11-28 03:24:45,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:24:45,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 03:24:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:45,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 03:24:45,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-28 03:24:45,423 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:24:45,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:45,558 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2024-11-28 03:24:45,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:24:45,559 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2024-11-28 03:24:45,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:45,560 INFO L225 Difference]: With dead ends: 50 [2024-11-28 03:24:45,560 INFO L226 Difference]: Without dead ends: 49 [2024-11-28 03:24:45,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-28 03:24:45,561 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:45,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 03:24:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-28 03:24:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-28 03:24:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:24:45,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2024-11-28 03:24:45,575 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 43 [2024-11-28 03:24:45,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:45,576 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2024-11-28 03:24:45,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:24:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2024-11-28 03:24:45,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-28 03:24:45,579 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:45,580 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:45,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-28 03:24:45,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:45,780 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:24:45,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:45,781 INFO L85 PathProgramCache]: Analyzing trace with hash 767260028, now seen corresponding path program 3 times [2024-11-28 03:24:45,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:45,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1289927459] [2024-11-28 03:24:45,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:24:45,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:45,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:45,785 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:45,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-28 03:24:49,056 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-28 03:24:49,056 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:24:49,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-28 03:24:49,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:49,266 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:24:49,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:24:49,779 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-28 03:24:49,779 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:24:49,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289927459] [2024-11-28 03:24:49,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289927459] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:24:49,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:24:49,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-11-28 03:24:49,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897610302] [2024-11-28 03:24:49,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:24:49,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 03:24:49,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:24:49,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 03:24:49,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2024-11-28 03:24:49,782 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:24:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:24:50,596 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2024-11-28 03:24:50,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-28 03:24:50,597 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2024-11-28 03:24:50,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:24:50,598 INFO L225 Difference]: With dead ends: 80 [2024-11-28 03:24:50,598 INFO L226 Difference]: Without dead ends: 79 [2024-11-28 03:24:50,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2024-11-28 03:24:50,599 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 03:24:50,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 374 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 03:24:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-28 03:24:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-28 03:24:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-28 03:24:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-11-28 03:24:50,630 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 58 [2024-11-28 03:24:50,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:24:50,630 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-11-28 03:24:50,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.142857142857143) internal successors, (66), 22 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:24:50,630 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-11-28 03:24:50,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-28 03:24:50,631 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:24:50,632 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:24:50,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-28 03:24:50,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:50,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:24:50,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:24:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash 458849212, now seen corresponding path program 4 times [2024-11-28 03:24:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:24:50,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1932377311] [2024-11-28 03:24:50,834 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:24:50,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:24:50,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:24:50,837 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:24:50,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-28 03:24:51,062 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:24:51,062 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:24:51,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-28 03:24:51,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:24:51,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-28 03:24:51,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:24:51,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:24:51,625 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:24:51,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 03:24:51,670 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:24:51,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 03:24:51,721 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 03:24:51,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-28 03:24:51,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-28 03:24:51,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 03:24:52,303 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 03:24:52,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2024-11-28 03:24:52,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-28 03:24:52,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-28 03:25:00,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:25:00,757 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 03:25:00,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 53 [2024-11-28 03:25:00,796 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-28 03:25:00,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-28 03:25:00,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-28 03:25:01,151 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-28 03:25:01,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 63 [2024-11-28 03:25:01,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 69 [2024-11-28 03:25:01,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-28 03:25:01,252 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-28 03:25:01,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-28 03:25:01,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2024-11-28 03:25:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 131 proven. 33 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-28 03:25:02,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:25:05,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:25:05,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 423 treesize of output 385 [2024-11-28 03:25:05,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:25:05,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 336 [2024-11-28 03:25:21,510 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:25:21,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932377311] [2024-11-28 03:25:21,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932377311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:25:21,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [173103954] [2024-11-28 03:25:21,510 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:25:21,510 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-28 03:25:21,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 [2024-11-28 03:25:21,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-28 03:25:21,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-28 03:25:22,012 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:25:22,012 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:25:22,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-28 03:25:22,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:25:23,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-28 03:25:26,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:25:26,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-28 03:25:30,669 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:25:30,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 03:25:31,288 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:25:31,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-28 03:25:32,065 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-28 03:25:32,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-28 03:25:34,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-28 03:25:34,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-28 03:25:42,828 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 03:25:42,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2024-11-28 03:25:42,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-28 03:25:42,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-28 03:26:01,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:26:01,963 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-28 03:26:01,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 53 [2024-11-28 03:26:02,844 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-11-28 03:26:02,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 53 [2024-11-28 03:26:03,740 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-28 03:26:03,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-28 03:26:06,780 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-11-28 03:26:06,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 63 [2024-11-28 03:26:06,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 69 [2024-11-28 03:26:06,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-28 03:26:07,604 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-28 03:26:07,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-28 03:26:10,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 80 [2024-11-28 03:26:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 131 proven. 33 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-28 03:26:16,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:26:20,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:26:20,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 423 treesize of output 385 [2024-11-28 03:26:20,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:26:20,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 336 [2024-11-28 03:26:34,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [173103954] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:26:34,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:26:34,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 38 [2024-11-28 03:26:34,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150714574] [2024-11-28 03:26:34,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:26:34,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-28 03:26:34,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:26:34,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-28 03:26:34,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1939, Unknown=9, NotChecked=0, Total=2070 [2024-11-28 03:26:34,845 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 29 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 03:26:42,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:26:46,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:26:50,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:26:54,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:27:31,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:27:31,586 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2024-11-28 03:27:31,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-28 03:27:31,587 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 29 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 88 [2024-11-28 03:27:31,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:27:31,588 INFO L225 Difference]: With dead ends: 152 [2024-11-28 03:27:31,588 INFO L226 Difference]: Without dead ends: 86 [2024-11-28 03:27:31,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 89.0s TimeCoverageRelationStatistics Valid=189, Invalid=2882, Unknown=9, NotChecked=0, Total=3080 [2024-11-28 03:27:31,592 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 33 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 7 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:27:31,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 534 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 861 Invalid, 4 Unknown, 0 Unchecked, 41.0s Time] [2024-11-28 03:27:31,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-28 03:27:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2024-11-28 03:27:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:27:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2024-11-28 03:27:31,613 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 88 [2024-11-28 03:27:31,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:27:31,613 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2024-11-28 03:27:31,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 29 states have internal predecessors, (67), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-28 03:27:31,613 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2024-11-28 03:27:31,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-28 03:27:31,614 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:27:31,614 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:27:31,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-28 03:27:31,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-28 03:27:32,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/cvc4 --incremental --print-success --lang smt [2024-11-28 03:27:32,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:27:32,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:27:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash 656695689, now seen corresponding path program 5 times [2024-11-28 03:27:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:27:32,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683635634] [2024-11-28 03:27:32,016 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 03:27:32,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:27:32,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:27:32,018 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:27:32,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-28 03:27:33,431 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-11-28 03:27:33,431 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:27:33,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 03:27:33,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:27:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-28 03:27:49,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:28:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-28 03:28:21,944 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:28:21,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683635634] [2024-11-28 03:28:21,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683635634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:28:21,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:28:21,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2024-11-28 03:28:21,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177709315] [2024-11-28 03:28:21,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:28:21,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-28 03:28:21,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:28:21,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-28 03:28:21,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1739, Unknown=0, NotChecked=0, Total=2070 [2024-11-28 03:28:21,947 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 46 states, 45 states have (on average 2.8) internal successors, (126), 46 states have internal predecessors, (126), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:29:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:13,628 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2024-11-28 03:29:13,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-28 03:29:13,629 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8) internal successors, (126), 46 states have internal predecessors, (126), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2024-11-28 03:29:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:13,631 INFO L225 Difference]: With dead ends: 145 [2024-11-28 03:29:13,631 INFO L226 Difference]: Without dead ends: 144 [2024-11-28 03:29:13,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 73.5s TimeCoverageRelationStatistics Valid=811, Invalid=3479, Unknown=0, NotChecked=0, Total=4290 [2024-11-28 03:29:13,633 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:13,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 940 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 20.7s Time] [2024-11-28 03:29:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-28 03:29:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-28 03:29:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-28 03:29:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2024-11-28 03:29:13,657 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 98 [2024-11-28 03:29:13,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:13,657 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2024-11-28 03:29:13,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8) internal successors, (126), 46 states have internal predecessors, (126), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-28 03:29:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2024-11-28 03:29:13,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-28 03:29:13,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:29:13,659 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:29:13,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-28 03:29:13,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:13,860 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2024-11-28 03:29:13,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:29:13,861 INFO L85 PathProgramCache]: Analyzing trace with hash 615720073, now seen corresponding path program 6 times [2024-11-28 03:29:13,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:29:13,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1011003010] [2024-11-28 03:29:13,861 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-28 03:29:13,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:13,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:29:13,863 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:29:13,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-28 03:29:19,443 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-28 03:29:19,443 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:29:19,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-28 03:29:19,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:29:20,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2024-11-28 03:29:20,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:29:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1295 trivial. 0 not checked. [2024-11-28 03:29:26,682 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:29:26,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011003010] [2024-11-28 03:29:26,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011003010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:29:26,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:29:26,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2024-11-28 03:29:26,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962078817] [2024-11-28 03:29:26,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:29:26,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 03:29:26,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:29:26,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 03:29:26,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:29:26,685 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-28 03:29:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:29:28,429 INFO L93 Difference]: Finished difference Result 149 states and 152 transitions. [2024-11-28 03:29:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:29:28,431 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 158 [2024-11-28 03:29:28,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:29:28,431 INFO L225 Difference]: With dead ends: 149 [2024-11-28 03:29:28,431 INFO L226 Difference]: Without dead ends: 0 [2024-11-28 03:29:28,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2024-11-28 03:29:28,432 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:29:28,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-28 03:29:28,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-28 03:29:28,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-28 03:29:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-28 03:29:28,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-28 03:29:28,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2024-11-28 03:29:28,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:29:28,433 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-28 03:29:28,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 6 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-28 03:29:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-28 03:29:28,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-28 03:29:28,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2024-11-28 03:29:28,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2024-11-28 03:29:28,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2024-11-28 03:29:28,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2024-11-28 03:29:28,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2024-11-28 03:29:28,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2024-11-28 03:29:28,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-28 03:29:28,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:29:28,642 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2024-11-28 03:29:28,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-28 03:29:34,975 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 35 DAG size of output: 25 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-28 03:29:44,371 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification. DAG size of input: 116 DAG size of output: 103 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-28 03:29:45,969 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:29:45,985 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:45,986 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:45,986 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-28 03:29:45,987 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:45,987 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:45,987 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:45,987 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-28 03:29:45,988 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-28 03:29:45,988 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:45,988 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:45,988 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:45,989 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-28 03:29:45,989 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-28 03:29:45,989 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-28 03:29:45,989 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:45,989 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:45,989 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-28 03:29:45,989 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-28 03:29:45,990 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-28 03:29:45,990 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:45,991 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:45,991 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-28 03:29:45,991 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:45,991 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:45,991 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2024-11-28 03:29:45,991 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-11-28 03:29:45,991 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2024-11-28 03:29:45,991 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-28 03:29:45,991 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-28 03:29:45,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2024-11-28 03:29:45,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2024-11-28 03:29:45,992 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-28 03:29:46,009 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,009 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,009 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-28 03:29:46,010 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-28 03:29:46,013 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-28 03:29:46,014 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-28 03:29:46,014 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-28 03:29:46,014 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-28 03:29:46,014 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-28 03:29:46,014 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-28 03:29:46,014 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-28 03:29:46,014 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,014 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,014 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,014 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-28 03:29:46,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-28 03:29:46,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-28 03:29:46,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-28 03:29:46,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,015 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-28 03:29:46,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-28 03:29:46,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-28 03:29:46,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-28 03:29:46,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-28 03:29:46,016 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-28 03:29:46,017 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-28 03:29:46,017 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-28 03:29:46,017 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-28 03:29:46,018 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,018 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,018 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,018 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,018 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,018 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,018 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-28 03:29:46,018 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-28 03:29:46,019 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-28 03:29:46,020 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-28 03:29:46,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-28 03:29:46,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,021 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,022 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,022 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,022 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-28 03:29:46,022 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,022 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,022 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-28 03:29:46,022 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,022 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,022 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,022 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-28 03:29:46,022 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-28 03:29:46,022 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-28 03:29:46,025 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-28 03:29:46,025 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-28 03:29:46,025 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-28 03:29:46,025 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,025 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,026 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,026 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-28 03:29:46,026 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-28 03:29:46,026 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,026 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,026 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,026 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,026 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,026 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,027 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,027 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,027 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,027 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!base [2024-11-28 03:29:46,027 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,027 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,027 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,027 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-28 03:29:46,027 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-28 03:29:46,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-28 03:29:46,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2024-11-28 03:29:46,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-28 03:29:46,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,028 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,029 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,029 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,030 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-28 03:29:46,030 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,030 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,030 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,031 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,031 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,031 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] [2024-11-28 03:29:46,031 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,031 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,031 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-28 03:29:46,031 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-28 03:29:46,031 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-28 03:29:46,032 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-28 03:29:46,032 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2024-11-28 03:29:46,032 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2024-11-28 03:29:46,032 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-28 03:29:46,032 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-28 03:29:46,032 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ptr~0!offset [2024-11-28 03:29:46,032 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,032 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,032 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,032 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] [2024-11-28 03:29:46,033 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2024-11-28 03:29:46,034 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2024-11-28 03:29:46,034 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] [2024-11-28 03:29:46,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:29:46 BoogieIcfgContainer [2024-11-28 03:29:46,034 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:29:46,036 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:29:46,036 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:29:46,037 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:29:46,037 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:24:41" (3/4) ... [2024-11-28 03:29:46,040 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 03:29:46,045 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2024-11-28 03:29:46,049 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-28 03:29:46,050 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-28 03:29:46,050 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 03:29:46,050 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-28 03:29:46,153 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 03:29:46,155 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 03:29:46,155 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:29:46,156 INFO L158 Benchmark]: Toolchain (without parser) took 305728.72ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 91.8MB in the beginning and 177.5MB in the end (delta: -85.7MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2024-11-28 03:29:46,156 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 117.4MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:29:46,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.39ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 73.2MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:29:46,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.90ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 71.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:29:46,159 INFO L158 Benchmark]: Boogie Preprocessor took 84.04ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 68.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:29:46,159 INFO L158 Benchmark]: RCFGBuilder took 522.90ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 51.0MB in the end (delta: 17.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:29:46,159 INFO L158 Benchmark]: TraceAbstraction took 304347.04ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 50.5MB in the beginning and 183.1MB in the end (delta: -132.6MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. [2024-11-28 03:29:46,160 INFO L158 Benchmark]: Witness Printer took 118.79ms. Allocated memory is still 260.0MB. Free memory was 183.1MB in the beginning and 177.5MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:29:46,162 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54ms. Allocated memory is still 117.4MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 583.39ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 73.2MB in the end (delta: 18.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.90ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 71.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 84.04ms. Allocated memory is still 117.4MB. Free memory was 71.3MB in the beginning and 68.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 522.90ms. Allocated memory is still 117.4MB. Free memory was 68.5MB in the beginning and 51.0MB in the end (delta: 17.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 304347.04ms. Allocated memory was 117.4MB in the beginning and 260.0MB in the end (delta: 142.6MB). Free memory was 50.5MB in the beginning and 183.1MB in the end (delta: -132.6MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. * Witness Printer took 118.79ms. Allocated memory is still 260.0MB. Free memory was 183.1MB in the beginning and 177.5MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~ptr~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ptr~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]],[BitvecLiteral[4,32]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[BitvecLiteral[0,32]]]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 585]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 617]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 286.9s, OverallIterations: 10, TraceHistogramMax: 23, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 111.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 64.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 2497 SdHoareTripleChecker+Invalid, 63.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2234 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2108 IncrementalHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 263 mSDtfsCounter, 2108 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1193 GetRequests, 1003 SyntacticMatches, 2 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 168.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=9, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 10.6s SatisfiabilityAnalysisTime, 160.6s InterpolantComputationTime, 662 NumberOfCodeBlocks, 528 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1036 ConstructedInterpolants, 34 QuantifiedInterpolants, 6410 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2566 ConjunctsInSsa, 260 ConjunctsInUnsatCore, 16 InterpolantComputations, 4 PerfectInterpolantSequences, 3352/4105 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((len == 0) && (2 == len)) || ((len == 1) && (2 == len))) || ((len == 2) && (2 == len))) - InvariantResult [Line: 611]: Loop Invariant Derived loop invariant: (((((3 == count) && (2 == len)) || ((1 == count) && (2 == len))) || ((2 == len) && (0 == count))) || ((2 == count) && (2 == len))) RESULT: Ultimate proved your program to be correct! [2024-11-28 03:29:46,388 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-28 03:29:46,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_63a841a4-0b04-4455-bc77-a7c08bb97443/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE