./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 02:12:46,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 02:12:46,958 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-25 02:12:46,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-25 02:12:46,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-25 02:12:47,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 02:12:47,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 02:12:47,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 02:12:47,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 02:12:47,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 02:12:47,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 02:12:47,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 02:12:47,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 02:12:47,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-25 02:12:47,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 02:12:47,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 02:12:47,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 02:12:47,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 02:12:47,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 02:12:47,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 02:12:47,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 02:12:47,011 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 02:12:47,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 02:12:47,011 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 02:12:47,011 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 02:12:47,012 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 02:12:47,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 02:12:47,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 02:12:47,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 02:12:47,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 02:12:47,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 02:12:47,013 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-25 02:12:47,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-25 02:12:47,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2024-11-25 02:12:47,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 02:12:47,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 02:12:47,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 02:12:47,388 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 02:12:47,389 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 02:12:47,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2024-11-25 02:12:51,023 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/data/605415ab6/58be51875d0943e3b7251a32a0416444/FLAG5d2eb6d8d [2024-11-25 02:12:51,593 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 02:12:51,594 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2024-11-25 02:12:51,613 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/data/605415ab6/58be51875d0943e3b7251a32a0416444/FLAG5d2eb6d8d [2024-11-25 02:12:51,649 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/data/605415ab6/58be51875d0943e3b7251a32a0416444 [2024-11-25 02:12:51,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 02:12:51,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 02:12:51,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 02:12:51,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 02:12:51,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 02:12:51,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:12:51" (1/1) ... [2024-11-25 02:12:51,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382d0179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:12:51, skipping insertion in model container [2024-11-25 02:12:51,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:12:51" (1/1) ... [2024-11-25 02:12:51,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 02:12:52,218 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2024-11-25 02:12:52,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 02:12:52,239 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 02:12:52,336 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2024-11-25 02:12:52,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 02:12:52,383 INFO L204 MainTranslator]: Completed translation [2024-11-25 02:12:52,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:12:52 WrapperNode [2024-11-25 02:12:52,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 02:12:52,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 02:12:52,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 02:12:52,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 02:12:52,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:12:52" (1/1) ... [2024-11-25 02:12:52,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:12:52" (1/1) ... [2024-11-25 02:12:52,456 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 104 [2024-11-25 02:12:52,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 02:12:52,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 02:12:52,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 02:12:52,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 02:12:52,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:12:52" (1/1) ... [2024-11-25 02:12:52,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:12:52" (1/1) ... [2024-11-25 02:12:52,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:12:52" (1/1) ... [2024-11-25 02:12:52,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:12:52" (1/1) ... [2024-11-25 02:12:52,496 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:12:52" (1/1) ... [2024-11-25 02:12:52,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:12:52" (1/1) ... [2024-11-25 02:12:52,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:12:52" (1/1) ... [2024-11-25 02:12:52,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:12:52" (1/1) ... [2024-11-25 02:12:52,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:12:52" (1/1) ... [2024-11-25 02:12:52,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 02:12:52,526 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 02:12:52,526 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 02:12:52,526 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 02:12:52,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:12:52" (1/1) ... [2024-11-25 02:12:52,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 02:12:52,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 02:12:52,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 02:12:52,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 02:12:52,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-25 02:12:52,628 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-25 02:12:52,628 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-25 02:12:52,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-25 02:12:52,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 02:12:52,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-25 02:12:52,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-25 02:12:52,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-25 02:12:52,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-25 02:12:52,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-25 02:12:52,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-25 02:12:52,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 02:12:52,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 02:12:52,792 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 02:12:52,794 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 02:12:53,077 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-25 02:12:53,077 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 02:12:53,236 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 02:12:53,237 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 02:12:53,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:12:53 BoogieIcfgContainer [2024-11-25 02:12:53,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 02:12:53,238 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 02:12:53,239 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 02:12:53,253 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 02:12:53,254 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:12:53" (1/1) ... [2024-11-25 02:12:53,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 02:12:53,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:12:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 16 states and 20 transitions. [2024-11-25 02:12:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2024-11-25 02:12:53,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 02:12:53,359 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:12:53,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:12:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:12:53,808 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-25 02:12:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:12:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 17 states and 20 transitions. [2024-11-25 02:12:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-11-25 02:12:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-25 02:12:53,918 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:12:53,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:12:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:12:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 02:12:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:12:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 18 states and 22 transitions. [2024-11-25 02:12:54,805 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-25 02:12:54,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 02:12:54,805 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:12:54,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:12:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:12:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 02:12:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:12:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 19 states and 23 transitions. [2024-11-25 02:12:55,333 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-25 02:12:55,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:12:55,334 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:12:55,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:12:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:13:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 26 states and 43 transitions. [2024-11-25 02:13:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 43 transitions. [2024-11-25 02:13:06,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:13:06,326 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:06,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:13:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 28 states and 48 transitions. [2024-11-25 02:13:15,377 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 48 transitions. [2024-11-25 02:13:15,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:13:15,378 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:15,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:13:30,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 32 states and 67 transitions. [2024-11-25 02:13:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 67 transitions. [2024-11-25 02:13:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:13:30,984 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:30,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:13:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 32 states and 67 transitions. [2024-11-25 02:13:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 67 transitions. [2024-11-25 02:13:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:13:37,418 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:37,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:13:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 32 states and 67 transitions. [2024-11-25 02:13:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 67 transitions. [2024-11-25 02:13:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:13:42,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:42,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:13:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:13:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 35 states and 79 transitions. [2024-11-25 02:13:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 79 transitions. [2024-11-25 02:13:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:13:53,036 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:13:53,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:13:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:13:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:01,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 35 states and 79 transitions. [2024-11-25 02:14:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 79 transitions. [2024-11-25 02:14:01,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:14:01,851 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:01,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:04,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 35 states and 79 transitions. [2024-11-25 02:14:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 79 transitions. [2024-11-25 02:14:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:14:04,355 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:04,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 37 states and 88 transitions. [2024-11-25 02:14:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 88 transitions. [2024-11-25 02:14:21,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:14:21,822 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:21,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:14:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 38 states and 93 transitions. [2024-11-25 02:14:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 93 transitions. [2024-11-25 02:14:27,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:14:27,204 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:27,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:36,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 38 states and 93 transitions. [2024-11-25 02:14:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 93 transitions. [2024-11-25 02:14:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:14:36,138 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:36,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:38,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:38,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 38 states and 93 transitions. [2024-11-25 02:14:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 93 transitions. [2024-11-25 02:14:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:14:38,141 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:38,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:14:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 39 states and 95 transitions. [2024-11-25 02:14:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 95 transitions. [2024-11-25 02:14:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:14:43,145 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:14:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:14:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 39 states and 95 transitions. [2024-11-25 02:14:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 95 transitions. [2024-11-25 02:14:51,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:14:51,907 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:14:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:14:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:14:56,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:04,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:15:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:15:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:15:04,152 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:04,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:15:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:15:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:15:06,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:15:06,532 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:06,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:15:13,649 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:15:13,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:15:13,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:13,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:15:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:15:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:15:16,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:15:16,885 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:16,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:15:18,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:18,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:15:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:15:18,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:15:18,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:18,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:22,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:15:22,175 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:15:22,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:15:22,176 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:22,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:27,239 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:15:32,474 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:15:32,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:15:32,475 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:32,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:38,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:15:38,180 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:15:38,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:15:38,180 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:38,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:15:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:15:41,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:15:41,496 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:41,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:15:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:15:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:15:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:15:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:15:46,769 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:15:46,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:15:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:15:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:16:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:16:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:16:02,262 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:02,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:05,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:16:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:16:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:16:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:16:07,560 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:07,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:16:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:16:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:16:13,936 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:13,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:15,616 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:16:16,628 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:16:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:16:16,628 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:16,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:19,467 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:16:20,260 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:16:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:16:20,261 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:20,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:16:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:16:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:16:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:16:24,152 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:24,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:16:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:16:31,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:16:31,925 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:31,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:38,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 41 states and 102 transitions. [2024-11-25 02:16:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 102 transitions. [2024-11-25 02:16:38,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:16:38,145 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:38,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-25 02:16:53,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:16:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 43 states and 100 transitions. [2024-11-25 02:16:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 100 transitions. [2024-11-25 02:16:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-25 02:16:53,743 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:16:53,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:16:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:16:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 02:17:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 49 states and 129 transitions. [2024-11-25 02:17:07,049 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 129 transitions. [2024-11-25 02:17:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-25 02:17:07,049 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:07,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-25 02:17:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-25 02:17:14,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 16 states and 16 transitions. [2024-11-25 02:17:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-25 02:17:14,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-25 02:17:14,158 WARN L417 CodeCheckObserver]: This Program is SAFE, Check terminated with 39 iterations. [2024-11-25 02:17:14,168 INFO L726 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2024-11-25 02:17:15,388 INFO L77 FloydHoareUtils]: At program point L589(line 589) the Hoare annotation is: (or (< |ULTIMATE.start_main_~len~0#1| 2) (let ((.cse0 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|))) (and (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#t~ret5#1.base|) 4))) (= (select .cse0 4) 0) (= (select .cse0 0) 0))) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (not (and (= |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (= |ULTIMATE.start_dll_circular_create_~head~0#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= |ULTIMATE.start_dll_circular_create_#t~ret5#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) [2024-11-25 02:17:15,388 INFO L77 FloydHoareUtils]: At program point main_returnLabel#1(lines 613 627) the Hoare annotation is: true [2024-11-25 02:17:15,388 INFO L77 FloydHoareUtils]: At program point L618-3(lines 618 620) the Hoare annotation is: true [2024-11-25 02:17:15,388 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 625) the Hoare annotation is: true [2024-11-25 02:17:15,389 INFO L77 FloydHoareUtils]: At program point L586(line 586) the Hoare annotation is: (and (<= 2 |ULTIMATE.start_main_~len~0#1|) (<= 2 |ULTIMATE.start_dll_circular_create_~len#1|) (<= |ULTIMATE.start_dll_circular_create_~len#1| 2) (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (<= |ULTIMATE.start_main_~len~0#1| 2) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_main_~#s~0#1.base| 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| 0)) [2024-11-25 02:17:15,389 INFO L77 FloydHoareUtils]: At program point L586-1(line 586) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 4))) (or (< |ULTIMATE.start_dll_circular_create_~len#1| 2) (not (and (= (select |#valid| |ULTIMATE.start_main_~#s~0#1.base|) 1) (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.offset| 0) (= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|) 1) (not (= |ULTIMATE.start_dll_circular_create_#t~ret4#1.base| 0)))) (< |ULTIMATE.start_main_~len~0#1| 2) (not (and (not (= .cse0 |ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_main_~#s~0#1.base| 0)))) (let ((.cse1 (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_create_#t~ret4#1.base|))) (and (= (select .cse1 4) 0) (= (select .cse1 0) 0) (= .cse0 0))))) [2024-11-25 02:17:15,389 INFO L77 FloydHoareUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2024-11-25 02:17:15,389 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2024-11-25 02:17:15,389 INFO L77 FloydHoareUtils]: At program point main_ERROR#1(line 625) the Hoare annotation is: true [2024-11-25 02:17:15,389 INFO L77 FloydHoareUtils]: At program point L621(lines 621 623) the Hoare annotation is: true [2024-11-25 02:17:15,389 INFO L77 FloydHoareUtils]: At program point L588-1(lines 588 596) the Hoare annotation is: true [2024-11-25 02:17:15,390 INFO L77 FloydHoareUtils]: At program point L588-3(lines 588 596) the Hoare annotation is: true [2024-11-25 02:17:15,390 INFO L77 FloydHoareUtils]: At program point L577(lines 577 579) the Hoare annotation is: (and (= (store |old(#valid)| |node_create_~temp~0#1.base| 1) |#valid|) (= |node_create_~temp~0#1.offset| 0) (not (= |node_create_~temp~0#1.base| 0)) (= 0 (select |old(#valid)| |node_create_~temp~0#1.base|))) [2024-11-25 02:17:15,390 INFO L75 FloydHoareUtils]: For program point L573(line 573) no Hoare annotation was computed. [2024-11-25 02:17:15,390 INFO L77 FloydHoareUtils]: At program point $Ultimate##0(lines 575 584) the Hoare annotation is: (= |old(#valid)| |#valid|) [2024-11-25 02:17:15,391 INFO L77 FloydHoareUtils]: At program point node_createEXIT(lines 575 584) the Hoare annotation is: (let ((.cse0 (select |#memory_$Pointer$.offset| |node_create_#res#1.base|))) (and (= (select .cse0 0) 0) (= (select |old(#valid)| |node_create_#res#1.base|) 0) (= (select .cse0 4) 0) (not (= |node_create_#res#1.base| 0)) (= (let ((.cse1 (@diff |old(#valid)| |#valid|))) (store |old(#valid)| .cse1 (select |#valid| .cse1))) |#valid|) (= 0 |node_create_#res#1.offset|) (= (select |#valid| |node_create_#res#1.base|) 1) (= (select (select |#memory_$Pointer$.base| |node_create_#res#1.base|) 4) 0))) [2024-11-25 02:17:15,406 WARN L162 FloydHoareUtils]: Requires clause for node_create contained old-variable. Original clause: (= |old(#valid)| |#valid|) Eliminated clause: true [2024-11-25 02:17:15,416 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:580) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:283) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:358) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:166) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:402) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:167) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateProcedureContract(DefaultTranslator.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:407) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:396) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateProcedureContract(BacktranslationService.java:100) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.createInvariantAndContractResults(CodeCheckObserver.java:544) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:518) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:166) 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) [2024-11-25 02:17:15,421 INFO L158 Benchmark]: Toolchain (without parser) took 263766.83ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 127.9MB in the beginning and 999.9MB in the end (delta: -872.1MB). Peak memory consumption was 707.7MB. Max. memory is 16.1GB. [2024-11-25 02:17:15,421 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 167.8MB. Free memory is still 103.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:17:15,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 728.51ms. Allocated memory is still 167.8MB. Free memory was 127.6MB in the beginning and 109.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 02:17:15,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.16ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:17:15,422 INFO L158 Benchmark]: Boogie Preprocessor took 61.73ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 106.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:17:15,422 INFO L158 Benchmark]: RCFGBuilder took 711.71ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 84.7MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-25 02:17:15,423 INFO L158 Benchmark]: CodeCheck took 262181.56ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 84.7MB in the beginning and 999.9MB in the end (delta: -915.2MB). Peak memory consumption was 665.7MB. Max. memory is 16.1GB. [2024-11-25 02:17:15,426 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 260.9s, OverallIterations: 39, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1670 SdHoareTripleChecker+Valid, 146.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 574 mSDsluCounter, 1084 SdHoareTripleChecker+Invalid, 136.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 298 mSDsCounter, 4341 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19201 IncrementalHoareTripleChecker+Invalid, 23542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4341 mSolverCounterUnsat, 786 mSDtfsCounter, 19201 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12073 GetRequests, 11064 SyntacticMatches, 421 SemanticMatches, 588 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202796 ImplicationChecksByTransitivity, 186.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: 0.2s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 115.2s InterpolantComputationTime, 680 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 642 ConstructedInterpolants, 0 QuantifiedInterpolants, 14518 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 3 PerfectInterpolantSequences, 68/267 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - PositiveResult [Line: 625]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int) de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: IllegalArgumentException: unknown symbol (@diff (Array Int Int) (Array Int Int) Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.getBinaryOperator(Term2Expression.java:580) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.54ms. Allocated memory is still 167.8MB. Free memory is still 103.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 728.51ms. Allocated memory is still 167.8MB. Free memory was 127.6MB in the beginning and 109.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.16ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 108.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.73ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 106.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 711.71ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 84.7MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * CodeCheck took 262181.56ms. Allocated memory was 167.8MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 84.7MB in the beginning and 999.9MB in the end (delta: -915.2MB). Peak memory consumption was 665.7MB. Max. memory is 16.1GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-25 02:17:15,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Ended with exit code 0 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_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/config/KojakReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-25 02:17:18,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-25 02:17:18,477 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2024-11-25 02:17:18,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-25 02:17:18,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-25 02:17:18,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-25 02:17:18,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-25 02:17:18,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-25 02:17:18,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-25 02:17:18,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-25 02:17:18,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-25 02:17:18,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-25 02:17:18,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-25 02:17:18,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-25 02:17:18,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-25 02:17:18,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-25 02:17:18,528 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-25 02:17:18,528 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-25 02:17:18,529 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-25 02:17:18,529 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-25 02:17:18,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-25 02:17:18,529 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-25 02:17:18,529 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-25 02:17:18,529 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-25 02:17:18,529 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-25 02:17:18,529 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-25 02:17:18,530 INFO L153 SettingsManager]: * Command for calling external solver=cvc4 --incremental --print-success --lang smt [2024-11-25 02:17:18,530 INFO L153 SettingsManager]: * Choose which separate solver to use for tracechecks=External_ModelsAndUnsatCoreMode [2024-11-25 02:17:18,530 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-25 02:17:18,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 02:17:18,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-25 02:17:18,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-25 02:17:18,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-25 02:17:18,530 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-25 02:17:18,530 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-25 02:17:18,531 INFO L153 SettingsManager]: * Use separate solver for trace checks=false [2024-11-25 02:17:18,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak 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 -> a81d76a671fec08918102c7898e8919d02b265d05707efa1508363dab4714d44 [2024-11-25 02:17:18,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-25 02:17:18,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-25 02:17:18,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-25 02:17:18,841 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-25 02:17:18,842 INFO L274 PluginConnector]: CDTParser initialized [2024-11-25 02:17:18,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/../../sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2024-11-25 02:17:21,807 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/data/bfdd9645a/716a1b360e10466a96ef80ae4f0b5cf1/FLAG1b8dbc4ee [2024-11-25 02:17:22,184 INFO L384 CDTParser]: Found 1 translation units. [2024-11-25 02:17:22,185 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i [2024-11-25 02:17:22,204 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/data/bfdd9645a/716a1b360e10466a96ef80ae4f0b5cf1/FLAG1b8dbc4ee [2024-11-25 02:17:22,227 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/data/bfdd9645a/716a1b360e10466a96ef80ae4f0b5cf1 [2024-11-25 02:17:22,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-25 02:17:22,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-25 02:17:22,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-25 02:17:22,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-25 02:17:22,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-25 02:17:22,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:17:22" (1/1) ... [2024-11-25 02:17:22,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113b520f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:17:22, skipping insertion in model container [2024-11-25 02:17:22,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 02:17:22" (1/1) ... [2024-11-25 02:17:22,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-25 02:17:22,639 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2024-11-25 02:17:22,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 02:17:22,654 INFO L200 MainTranslator]: Completed pre-run [2024-11-25 02:17:22,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/sv-benchmarks/c/list-simple/dll2c_remove_all_reverse.i[24177,24190] [2024-11-25 02:17:22,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-25 02:17:22,736 INFO L204 MainTranslator]: Completed translation [2024-11-25 02:17:22,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:17:22 WrapperNode [2024-11-25 02:17:22,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-25 02:17:22,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-25 02:17:22,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-25 02:17:22,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-25 02:17:22,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:17:22" (1/1) ... [2024-11-25 02:17:22,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:17:22" (1/1) ... [2024-11-25 02:17:22,796 INFO L138 Inliner]: procedures = 129, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 105 [2024-11-25 02:17:22,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-25 02:17:22,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-25 02:17:22,801 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-25 02:17:22,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-25 02:17:22,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:17:22" (1/1) ... [2024-11-25 02:17:22,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:17:22" (1/1) ... [2024-11-25 02:17:22,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:17:22" (1/1) ... [2024-11-25 02:17:22,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:17:22" (1/1) ... [2024-11-25 02:17:22,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:17:22" (1/1) ... [2024-11-25 02:17:22,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:17:22" (1/1) ... [2024-11-25 02:17:22,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:17:22" (1/1) ... [2024-11-25 02:17:22,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:17:22" (1/1) ... [2024-11-25 02:17:22,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:17:22" (1/1) ... [2024-11-25 02:17:22,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-25 02:17:22,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-25 02:17:22,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-25 02:17:22,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-25 02:17:22,858 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 02:17:22" (1/1) ... [2024-11-25 02:17:22,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-25 02:17:22,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/z3 [2024-11-25 02:17:22,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-25 02:17:22,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-25 02:17:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-25 02:17:22,934 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-25 02:17:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-25 02:17:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-25 02:17:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-25 02:17:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-25 02:17:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-25 02:17:22,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-25 02:17:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-25 02:17:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-25 02:17:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-25 02:17:22,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-25 02:17:22,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-25 02:17:23,074 INFO L234 CfgBuilder]: Building ICFG [2024-11-25 02:17:23,077 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-25 02:17:23,442 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-25 02:17:23,442 INFO L283 CfgBuilder]: Performing block encoding [2024-11-25 02:17:23,548 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-25 02:17:23,548 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-25 02:17:23,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:17:23 BoogieIcfgContainer [2024-11-25 02:17:23,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-25 02:17:23,549 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-25 02:17:23,550 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-25 02:17:23,560 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-25 02:17:23,560 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 02:17:23" (1/1) ... [2024-11-25 02:17:23,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-25 02:17:23,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:23,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 16 states and 20 transitions. [2024-11-25 02:17:23,616 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2024-11-25 02:17:23,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-25 02:17:23,620 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:23,621 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:17:23,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:17:23,625 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:17:23,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-25 02:17:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:23,831 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:17:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:23,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 02:17:23,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:17:24,013 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-25 02:17:24,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (2)] Forceful destruction successful, exit code 0 [2024-11-25 02:17:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 17 states and 21 transitions. [2024-11-25 02:17:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-11-25 02:17:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-25 02:17:24,346 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:24,347 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:17:24,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:17:24,349 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:17:24,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-25 02:17:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:24,577 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:17:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:24,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-25 02:17:24,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:17:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 02:17:24,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (3)] Forceful destruction successful, exit code 0 [2024-11-25 02:17:25,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 18 states and 23 transitions. [2024-11-25 02:17:25,682 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2024-11-25 02:17:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-25 02:17:25,682 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:25,683 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:17:25,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:17:25,685 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:17:25,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-25 02:17:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:25,939 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:17:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:26,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-25 02:17:26,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:17:26,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-25 02:17:26,141 ERROR L418 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (4)] Exception during sending of exit command (exit): Broken pipe [2024-11-25 02:17:26,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-25 02:17:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 19 states and 24 transitions. [2024-11-25 02:17:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2024-11-25 02:17:26,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:17:26,780 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:26,780 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:17:26,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:17:26,782 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:17:26,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-25 02:17:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:27,488 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:17:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:27,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-25 02:17:27,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:17:27,674 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-25 02:17:28,010 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-25 02:17:28,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-11-25 02:17:28,586 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-25 02:17:28,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-25 02:17:28,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:17:28,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:17:28,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-25 02:17:28,858 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:17:28,859 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2024-11-25 02:17:28,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-25 02:17:28,889 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:17:28,893 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2024-11-25 02:17:28,907 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 8 treesize of output 1 [2024-11-25 02:17:29,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:17:29,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2024-11-25 02:17:29,188 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-25 02:17:29,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 51 [2024-11-25 02:17:29,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2024-11-25 02:17:29,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 31 [2024-11-25 02:17:29,252 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 12 treesize of output 11 [2024-11-25 02:17:29,926 INFO L349 Elim1Store]: treesize reduction 237, result has 8.5 percent of original size [2024-11-25 02:17:29,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 495 treesize of output 194 [2024-11-25 02:17:29,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:17:29,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 60 [2024-11-25 02:17:29,995 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:17:30,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 55 [2024-11-25 02:17:30,026 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 15 [2024-11-25 02:17:30,045 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 16 treesize of output 1 [2024-11-25 02:17:30,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-25 02:17:30,918 INFO L349 Elim1Store]: treesize reduction 371, result has 6.1 percent of original size [2024-11-25 02:17:30,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 13 new quantified variables, introduced 25 case distinctions, treesize of input 363 treesize of output 327 [2024-11-25 02:17:30,974 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:17:30,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 250 [2024-11-25 02:17:31,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 208 [2024-11-25 02:17:31,197 INFO L349 Elim1Store]: treesize reduction 69, result has 6.8 percent of original size [2024-11-25 02:17:31,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 291 [2024-11-25 02:17:31,333 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-25 02:17:31,344 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:17:31,346 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 441 [2024-11-25 02:17:31,380 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:17:31,381 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2024-11-25 02:17:31,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:17:31,446 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:17:31,446 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 84 [2024-11-25 02:17:31,470 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:17:31,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:17:31,496 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:17:31,497 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:17:31,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 14 [2024-11-25 02:17:31,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-11-25 02:17:32,244 INFO L349 Elim1Store]: treesize reduction 155, result has 21.3 percent of original size [2024-11-25 02:17:32,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 4635 treesize of output 3540 [2024-11-25 02:17:32,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:17:32,540 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:17:32,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:17:32,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:17:32,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 7 disjoint index pairs (out of 36 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 162 treesize of output 174 [2024-11-25 02:17:33,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:17:33,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-25 02:17:49,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-25 02:17:50,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-25 02:17:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:17:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 26 states and 48 transitions. [2024-11-25 02:17:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 48 transitions. [2024-11-25 02:17:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:17:51,344 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:17:51,344 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:17:51,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:17:51,347 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:17:51,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-25 02:17:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:51,917 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:17:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:17:52,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-25 02:17:52,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:17:52,032 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-25 02:17:52,129 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-25 02:17:52,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-11-25 02:17:52,311 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-25 02:17:52,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-25 02:17:52,368 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:17:52,368 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2024-11-25 02:17:52,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:17:52,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:17:52,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-25 02:17:52,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-25 02:17:52,438 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:17:52,438 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2024-11-25 02:17:52,450 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 8 treesize of output 1 [2024-11-25 02:17:52,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:17:52,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 42 [2024-11-25 02:17:52,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2024-11-25 02:17:52,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 31 [2024-11-25 02:17:52,647 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 12 treesize of output 11 [2024-11-25 02:17:52,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 42 [2024-11-25 02:17:53,052 INFO L349 Elim1Store]: treesize reduction 237, result has 8.5 percent of original size [2024-11-25 02:17:53,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 495 treesize of output 194 [2024-11-25 02:17:53,179 INFO L349 Elim1Store]: treesize reduction 140, result has 9.1 percent of original size [2024-11-25 02:17:53,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 270 treesize of output 173 [2024-11-25 02:17:53,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:17:53,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 54 [2024-11-25 02:17:53,222 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 73 treesize of output 55 [2024-11-25 02:17:53,255 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 24 treesize of output 1 [2024-11-25 02:17:53,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-25 02:17:54,091 INFO L349 Elim1Store]: treesize reduction 375, result has 5.1 percent of original size [2024-11-25 02:17:54,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 13 new quantified variables, introduced 25 case distinctions, treesize of input 363 treesize of output 323 [2024-11-25 02:17:54,128 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:17:54,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 218 [2024-11-25 02:17:54,356 INFO L349 Elim1Store]: treesize reduction 69, result has 6.8 percent of original size [2024-11-25 02:17:54,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 264 treesize of output 269 [2024-11-25 02:17:54,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 126 [2024-11-25 02:17:54,508 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-25 02:17:54,524 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:17:54,524 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2024-11-25 02:17:54,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:17:54,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:17:54,593 INFO L349 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2024-11-25 02:17:54,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 88 [2024-11-25 02:17:54,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 83 treesize of output 68 [2024-11-25 02:17:54,645 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:17:54,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 14 [2024-11-25 02:17:54,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-11-25 02:17:54,675 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:17:54,676 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2024-11-25 02:17:54,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:17:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:17:55,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-25 02:17:55,219 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (= (_ bv0 32) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse9 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse3 (select .cse9 (_ bv0 32))) (.cse7 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse5 (select .cse9 (_ bv4 32))) (.cse4 (select .cse7 (_ bv4 32))) (.cse8 (select |c_#memory_$Pointer$.offset| .cse3))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse3 .cse4) (= v_arrayElimIndex_18 .cse5) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)) (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (= .cse3 (select .cse7 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse5 .cse4) (= (_ bv0 32) (select .cse8 (_ bv0 32))) (= (select .cse8 (_ bv4 32)) (_ bv0 32)) (not (= .cse3 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse13 (select .cse12 (_ bv4 32)))) (let ((.cse18 (select |c_#memory_$Pointer$.base| .cse13))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse18 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse10 (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse16 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse11 (select .cse18 (_ bv0 32))) (.cse17 (select |c_#memory_$Pointer$.offset| .cse16))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse1) (= .cse11 (select .cse12 (_ bv0 32))) (= .cse13 .cse11) (not (= v_arrayElimCell_14 .cse11)) (= (_ bv0 32) (select .cse14 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse15 .cse16)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse11)) (= v_DerPreprocessor_4 .cse16) (= .cse16 .cse11) (= (select .cse14 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse17 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse11) (_ bv4 32)) .cse13) (= (_ bv0 32) (select .cse17 (_ bv4 32)))))))))))) .cse2)))) is different from false [2024-11-25 02:17:56,022 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse2 (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (= (_ bv0 32) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse9 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse3 (select .cse9 (_ bv0 32))) (.cse7 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse5 (select .cse9 (_ bv4 32))) (.cse4 (select .cse7 (_ bv4 32))) (.cse8 (select |c_#memory_$Pointer$.offset| .cse3))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse3 .cse4) (= v_arrayElimIndex_18 .cse5) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)) (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (= .cse3 (select .cse7 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse5 .cse4) (= (_ bv0 32) (select .cse8 (_ bv0 32))) (= (select .cse8 (_ bv4 32)) (_ bv0 32)) (not (= .cse3 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse13 (select .cse12 (_ bv4 32)))) (let ((.cse18 (select |c_#memory_$Pointer$.base| .cse13))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse18 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse10 (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse16 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse14 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse11 (select .cse18 (_ bv0 32))) (.cse17 (select |c_#memory_$Pointer$.offset| .cse16))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse1) (= .cse11 (select .cse12 (_ bv0 32))) (= .cse13 .cse11) (not (= v_arrayElimCell_14 .cse11)) (= (_ bv0 32) (select .cse14 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse15 .cse16)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse11)) (= v_DerPreprocessor_4 .cse16) (= .cse16 .cse11) (= (select .cse14 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse17 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse11) (_ bv4 32)) .cse13) (= (_ bv0 32) (select .cse17 (_ bv4 32)))))))))))) .cse2))))) is different from true [2024-11-25 02:18:06,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-25 02:18:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:18:07,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 27 states and 58 transitions. [2024-11-25 02:18:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 58 transitions. [2024-11-25 02:18:07,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:18:07,613 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:18:07,613 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:18:07,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:18:07,617 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:18:07,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-25 02:18:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:08,369 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:18:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:18:08,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-25 02:18:08,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:18:08,581 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-25 02:18:08,683 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-25 02:18:08,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-11-25 02:18:08,879 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-25 02:18:08,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-25 02:18:08,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:18:08,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:18:08,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-25 02:18:08,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:18:08,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:18:08,968 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 8 treesize of output 7 [2024-11-25 02:18:08,977 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:18:08,978 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2024-11-25 02:18:29,328 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-25 02:18:29,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 67 [2024-11-25 02:18:29,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 45 [2024-11-25 02:18:29,759 INFO L349 Elim1Store]: treesize reduction 237, result has 8.5 percent of original size [2024-11-25 02:18:29,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 495 treesize of output 194 [2024-11-25 02:18:29,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:18:29,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 56 [2024-11-25 02:18:29,887 INFO L349 Elim1Store]: treesize reduction 110, result has 7.6 percent of original size [2024-11-25 02:18:29,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 96 [2024-11-25 02:18:29,906 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 73 treesize of output 55 [2024-11-25 02:18:29,917 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 24 treesize of output 1 [2024-11-25 02:18:29,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-25 02:18:30,657 INFO L349 Elim1Store]: treesize reduction 375, result has 5.1 percent of original size [2024-11-25 02:18:30,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 13 new quantified variables, introduced 25 case distinctions, treesize of input 363 treesize of output 323 [2024-11-25 02:18:30,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:18:30,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 242 [2024-11-25 02:18:30,784 INFO L349 Elim1Store]: treesize reduction 69, result has 6.8 percent of original size [2024-11-25 02:18:30,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 292 treesize of output 301 [2024-11-25 02:18:30,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 138 [2024-11-25 02:18:30,900 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-25 02:18:30,908 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:18:30,909 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 407 [2024-11-25 02:18:30,925 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:18:30,926 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2024-11-25 02:18:30,941 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:18:30,955 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:18:30,955 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 201 [2024-11-25 02:18:30,970 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:18:30,971 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2024-11-25 02:18:30,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:18:32,330 INFO L349 Elim1Store]: treesize reduction 104, result has 27.3 percent of original size [2024-11-25 02:18:32,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 2059 treesize of output 1484 [2024-11-25 02:18:32,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:18:32,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:18:32,431 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:18:32,469 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:18:32,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:18:32,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:18:32,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:18:32,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 522 treesize of output 502 [2024-11-25 02:18:32,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 223 [2024-11-25 02:18:33,049 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 0 case distinctions, treesize of input 110 treesize of output 107 [2024-11-25 02:18:33,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-25 02:18:35,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 29 [2024-11-25 02:18:35,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 23 [2024-11-25 02:18:35,048 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 45 treesize of output 35 [2024-11-25 02:18:35,053 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 31 treesize of output 23 [2024-11-25 02:18:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:18:35,069 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-25 02:18:45,111 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32))) (.cse2 (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse3 (not (= (_ bv0 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse4 (= (_ bv0 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (_ bv4 32)))) (.cse6 (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (and (= (select .cse0 (_ bv4 32)) (_ bv0 32)) .cse1 .cse2 .cse3 .cse4 (not (and .cse1 .cse2 .cse3 .cse4 (exists ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (_ bv4 32) (_ bv0 32)))) .cse5 .cse6 .cse7)) .cse5 .cse6 (not (= |c_ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))) .cse7 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2024-11-25 02:19:16,047 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| (_ bv0 32))) (.cse2 (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse3 (not (= (_ bv0 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse4 (= (_ bv0 32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (_ bv4 32)))) (.cse6 (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (and (= (select .cse0 (_ bv4 32)) (_ bv0 32)) .cse1 .cse2 .cse3 .cse4 (not (and .cse1 .cse2 .cse3 .cse4 (exists ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse0 (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (_ bv4 32) (_ bv0 32)))) .cse5 .cse6 .cse7)) .cse5 .cse6 (not (= |c_ULTIMATE.start_dll_circular_create_~len#1| (_ bv2 32))) .cse7 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)))) is different from true [2024-11-25 02:19:16,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (= (_ bv0 32) (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse5 (select .cse4 (_ bv4 32)))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse12 (select .cse14 (_ bv4 32)))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse12 v_DerPreprocessor_23))) (let ((.cse10 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse2 v_DerPreprocessor_27) .cse12 v_DerPreprocessor_28))) (let ((.cse3 (select .cse14 (_ bv0 32))) (.cse7 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse1 .cse2) v_DerPreprocessor_22) (= .cse3 (select .cse4 (_ bv0 32))) (= .cse5 .cse3) (= .cse2 .cse3) (= (_ bv0 32) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse3)) (= (_ bv0 32) (select .cse7 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)) (= .cse2 v_DerPreprocessor_20) (= (select .cse7 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse8 (_ bv4 32))) (= (select .cse9 .cse2) v_DerPreprocessor_27) (= (select .cse8 (_ bv0 32)) (_ bv0 32)) (= (store .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse11) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse12 .cse5) (= (store .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse13)))))))))))) (= (_ bv0 32) (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse15 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse22 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse16 (select .cse22 (_ bv0 32))) (.cse20 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse19 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse18 (select .cse22 (_ bv4 32))) (.cse17 (select .cse20 (_ bv4 32))) (.cse21 (select |c_#memory_$Pointer$.offset| .cse16))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse16 .cse17) (= v_arrayElimIndex_18 .cse18) (= (_ bv0 32) (select .cse19 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= (select .cse19 (_ bv4 32)) (_ bv0 32)) (= .cse16 (select .cse20 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse18 .cse17) (= (_ bv0 32) (select .cse21 (_ bv0 32))) (= (select .cse21 (_ bv4 32)) (_ bv0 32)) (not (= .cse16 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse26 (select .cse25 (_ bv4 32)))) (let ((.cse31 (select |c_#memory_$Pointer$.base| .cse26))) (let ((.cse28 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse31 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse23 (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse29 (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse27 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse24 (select .cse31 (_ bv0 32))) (.cse30 (select |c_#memory_$Pointer$.offset| .cse29))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse11) (= .cse24 (select .cse25 (_ bv0 32))) (= .cse26 .cse24) (not (= v_arrayElimCell_14 .cse24)) (= (_ bv0 32) (select .cse27 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse28 .cse29)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse24)) (= v_DerPreprocessor_4 .cse29) (= .cse29 .cse24) (= (select .cse27 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse30 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse24) (_ bv4 32)) .cse26) (= (_ bv0 32) (select .cse30 (_ bv4 32)))))))))))) .cse15))))) is different from false [2024-11-25 02:19:17,160 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse14 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (= (_ bv0 32) (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse4 (select .cse3 (_ bv4 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse11 (select .cse13 (_ bv4 32)))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse11 v_DerPreprocessor_23))) (let ((.cse9 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse1 v_DerPreprocessor_27) .cse11 v_DerPreprocessor_28))) (let ((.cse2 (select .cse13 (_ bv0 32))) (.cse6 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse0 .cse1) v_DerPreprocessor_22) (= .cse2 (select .cse3 (_ bv0 32))) (= .cse4 .cse2) (= .cse1 .cse2) (= (_ bv0 32) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse2)) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2)) (= .cse1 v_DerPreprocessor_20) (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse7 (_ bv4 32))) (= (select .cse8 .cse1) v_DerPreprocessor_27) (= (select .cse7 (_ bv0 32)) (_ bv0 32)) (= (store .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse11 .cse4) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12))))))))))))) (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (= (_ bv0 32) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse15 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse22 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse16 (select .cse22 (_ bv0 32))) (.cse20 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse19 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse18 (select .cse22 (_ bv4 32))) (.cse17 (select .cse20 (_ bv4 32))) (.cse21 (select |c_#memory_$Pointer$.offset| .cse16))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse16 .cse17) (= v_arrayElimIndex_18 .cse18) (= (_ bv0 32) (select .cse19 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= (select .cse19 (_ bv4 32)) (_ bv0 32)) (= .cse16 (select .cse20 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse18 .cse17) (= (_ bv0 32) (select .cse21 (_ bv0 32))) (= (select .cse21 (_ bv4 32)) (_ bv0 32)) (not (= .cse16 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse26 (select .cse25 (_ bv4 32)))) (let ((.cse31 (select |c_#memory_$Pointer$.base| .cse26))) (let ((.cse28 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse31 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse23 (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse29 (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse27 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse24 (select .cse31 (_ bv0 32))) (.cse30 (select |c_#memory_$Pointer$.offset| .cse29))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (= .cse24 (select .cse25 (_ bv0 32))) (= .cse26 .cse24) (not (= v_arrayElimCell_14 .cse24)) (= (_ bv0 32) (select .cse27 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse28 .cse29)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse24)) (= v_DerPreprocessor_4 .cse29) (= .cse29 .cse24) (= (select .cse27 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse30 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse24) (_ bv4 32)) .cse26) (= (_ bv0 32) (select .cse30 (_ bv4 32)))))))))))) .cse15))))) is different from false [2024-11-25 02:19:17,210 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse13 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse11 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (= (_ bv0 32) (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse5 (select .cse4 (_ bv4 32)))) (let ((.cse14 (select |c_#memory_$Pointer$.base| .cse5))) (let ((.cse12 (select .cse14 (_ bv4 32)))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse12 v_DerPreprocessor_23))) (let ((.cse10 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse2 (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse2 v_DerPreprocessor_27) .cse12 v_DerPreprocessor_28))) (let ((.cse3 (select .cse14 (_ bv0 32))) (.cse7 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse8 (select |c_#memory_$Pointer$.offset| .cse2)) (.cse6 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse1 .cse2) v_DerPreprocessor_22) (= .cse3 (select .cse4 (_ bv0 32))) (= .cse5 .cse3) (= .cse2 .cse3) (= (_ bv0 32) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse3)) (= (_ bv0 32) (select .cse7 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)) (= .cse2 v_DerPreprocessor_20) (= (select .cse7 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse8 (_ bv4 32))) (= (select .cse9 .cse2) v_DerPreprocessor_27) (= (select .cse8 (_ bv0 32)) (_ bv0 32)) (= (store .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse11) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse12 .cse5) (= (store .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse13)))))))))))) (= (_ bv0 32) (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse15 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse22 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse16 (select .cse22 (_ bv0 32))) (.cse20 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse19 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse18 (select .cse22 (_ bv4 32))) (.cse17 (select .cse20 (_ bv4 32))) (.cse21 (select |c_#memory_$Pointer$.offset| .cse16))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse16 .cse17) (= v_arrayElimIndex_18 .cse18) (= (_ bv0 32) (select .cse19 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= (select .cse19 (_ bv4 32)) (_ bv0 32)) (= .cse16 (select .cse20 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse18 .cse17) (= (_ bv0 32) (select .cse21 (_ bv0 32))) (= (select .cse21 (_ bv4 32)) (_ bv0 32)) (not (= .cse16 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse26 (select .cse25 (_ bv4 32)))) (let ((.cse31 (select |c_#memory_$Pointer$.base| .cse26))) (let ((.cse28 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse31 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse23 (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse29 (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse27 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse24 (select .cse31 (_ bv0 32))) (.cse30 (select |c_#memory_$Pointer$.offset| .cse29))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse11) (= .cse24 (select .cse25 (_ bv0 32))) (= .cse26 .cse24) (not (= v_arrayElimCell_14 .cse24)) (= (_ bv0 32) (select .cse27 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse28 .cse29)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse24)) (= v_DerPreprocessor_4 .cse29) (= .cse29 .cse24) (= (select .cse27 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse30 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse24) (_ bv4 32)) .cse26) (= (_ bv0 32) (select .cse30 (_ bv4 32)))))))))))) .cse15)))))) is different from true [2024-11-25 02:19:17,235 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse14 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (= (_ bv0 32) (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse4 (select .cse3 (_ bv4 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse11 (select .cse13 (_ bv4 32)))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse11 v_DerPreprocessor_23))) (let ((.cse9 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse1 v_DerPreprocessor_27) .cse11 v_DerPreprocessor_28))) (let ((.cse2 (select .cse13 (_ bv0 32))) (.cse6 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse0 .cse1) v_DerPreprocessor_22) (= .cse2 (select .cse3 (_ bv0 32))) (= .cse4 .cse2) (= .cse1 .cse2) (= (_ bv0 32) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse2)) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2)) (= .cse1 v_DerPreprocessor_20) (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse7 (_ bv4 32))) (= (select .cse8 .cse1) v_DerPreprocessor_27) (= (select .cse7 (_ bv0 32)) (_ bv0 32)) (= (store .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse11 .cse4) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12))))))))))))) (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (= (_ bv0 32) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse15 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse22 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse16 (select .cse22 (_ bv0 32))) (.cse20 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse19 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse18 (select .cse22 (_ bv4 32))) (.cse17 (select .cse20 (_ bv4 32))) (.cse21 (select |c_#memory_$Pointer$.offset| .cse16))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse16 .cse17) (= v_arrayElimIndex_18 .cse18) (= (_ bv0 32) (select .cse19 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= (select .cse19 (_ bv4 32)) (_ bv0 32)) (= .cse16 (select .cse20 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse18 .cse17) (= (_ bv0 32) (select .cse21 (_ bv0 32))) (= (select .cse21 (_ bv4 32)) (_ bv0 32)) (not (= .cse16 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse25 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse26 (select .cse25 (_ bv4 32)))) (let ((.cse31 (select |c_#memory_$Pointer$.base| .cse26))) (let ((.cse28 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse31 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse23 (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse29 (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse27 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse24 (select .cse31 (_ bv0 32))) (.cse30 (select |c_#memory_$Pointer$.offset| .cse29))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (= .cse24 (select .cse25 (_ bv0 32))) (= .cse26 .cse24) (not (= v_arrayElimCell_14 .cse24)) (= (_ bv0 32) (select .cse27 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse28 .cse29)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse24)) (= v_DerPreprocessor_4 .cse29) (= .cse29 .cse24) (= (select .cse27 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse30 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse24) (_ bv4 32)) .cse26) (= (_ bv0 32) (select .cse30 (_ bv4 32)))))))))))) .cse15)))))) is different from true [2024-11-25 02:19:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:19:17,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 29 states and 75 transitions. [2024-11-25 02:19:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 75 transitions. [2024-11-25 02:19:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:19:17,253 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:19:17,253 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:19:17,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:19:17,255 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:19:17,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-25 02:19:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:19:17,866 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:19:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:19:17,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-25 02:19:17,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:19:17,976 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-25 02:19:18,065 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-25 02:19:18,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-11-25 02:19:18,243 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-25 02:19:18,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-25 02:19:18,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-25 02:19:18,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-11-25 02:19:18,354 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 8 treesize of output 7 [2024-11-25 02:19:18,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:18,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:19:18,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-25 02:19:18,391 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:18,391 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2024-11-25 02:19:18,461 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-25 02:19:18,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 67 [2024-11-25 02:19:18,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 45 [2024-11-25 02:19:18,915 INFO L349 Elim1Store]: treesize reduction 237, result has 8.5 percent of original size [2024-11-25 02:19:18,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 495 treesize of output 194 [2024-11-25 02:19:18,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:18,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2024-11-25 02:19:18,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-11-25 02:19:18,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-25 02:19:18,991 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:18,992 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2024-11-25 02:19:20,134 INFO L349 Elim1Store]: treesize reduction 373, result has 5.6 percent of original size [2024-11-25 02:19:20,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 25 case distinctions, treesize of input 404 treesize of output 373 [2024-11-25 02:19:20,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 234 [2024-11-25 02:19:20,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 200 [2024-11-25 02:19:20,313 INFO L349 Elim1Store]: treesize reduction 69, result has 6.8 percent of original size [2024-11-25 02:19:20,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 262 treesize of output 267 [2024-11-25 02:19:20,353 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 15 [2024-11-25 02:19:20,360 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-25 02:19:20,443 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:20,444 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 339 [2024-11-25 02:19:20,460 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:20,460 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2024-11-25 02:19:20,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:20,501 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:20,502 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2024-11-25 02:19:20,517 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:20,532 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:20,533 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 165 [2024-11-25 02:19:22,127 INFO L349 Elim1Store]: treesize reduction 157, result has 20.3 percent of original size [2024-11-25 02:19:22,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 5382 treesize of output 4822 [2024-11-25 02:19:22,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:22,247 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:22,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:22,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:22,314 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:22,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:22,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 502 treesize of output 482 [2024-11-25 02:19:22,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 215 [2024-11-25 02:19:22,844 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 0 case distinctions, treesize of input 106 treesize of output 103 [2024-11-25 02:19:23,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-25 02:19:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:19:24,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-25 02:19:25,785 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) (exists ((v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse1 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse2 (select .cse1 (_ bv4 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) (_ bv0 32)))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse0 (select .cse1 (_ bv0 32))) (= .cse2 .cse0) (not (= v_arrayElimCell_14 .cse0)) (= (_ bv0 32) (select .cse3 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (= .cse0 .cse4) (= (select .cse3 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) (_ bv0 32)) (_ bv0 32)) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse0) (_ bv4 32)) .cse2) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| .cse0) (_ bv4 32)))))))) .cse5 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|) (not (and (exists ((v_arrayElimIndex_38 (_ BitVec 32)) (v_arrayElimIndex_40 (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_40) (_ bv0 32)))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_38)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse8 (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_32))) (and (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse7)) (= .cse7 (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_38) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_38)) (= .cse7 .cse4) (= .cse7 (select (select .cse8 v_arrayElimIndex_38) (_ bv4 32))) (= (_ bv0 32) (select .cse9 (_ bv4 32))) (= (_ bv0 32) (select .cse9 (_ bv0 32))) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (= v_arrayElimIndex_40 .cse7) (= .cse7 (select (select .cse8 v_arrayElimIndex_40) (_ bv0 32))) (not (= v_arrayElimIndex_38 .cse7)) (= (select v_DerPreprocessor_32 (_ bv4 32)) .cse7) (not (= (_ bv0 32) v_arrayElimIndex_38)) (= .cse7 (select (select |c_#memory_$Pointer$.base| .cse7) (_ bv4 32))))))) .cse5)))) is different from false [2024-11-25 02:19:28,194 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) (exists ((v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse1 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse2 (select .cse1 (_ bv4 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) (_ bv0 32)))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse0 (select .cse1 (_ bv0 32))) (= .cse2 .cse0) (not (= v_arrayElimCell_14 .cse0)) (= (_ bv0 32) (select .cse3 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (= .cse0 .cse4) (= (select .cse3 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) (_ bv0 32)) (_ bv0 32)) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse0) (_ bv4 32)) .cse2) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| .cse0) (_ bv4 32)))))))) .cse5 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|) (not (and (exists ((v_arrayElimIndex_38 (_ BitVec 32)) (v_arrayElimIndex_40 (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_40) (_ bv0 32)))) (let ((.cse9 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_38)) (.cse6 (select |c_#memory_$Pointer$.offset| .cse7)) (.cse8 (store |c_#memory_$Pointer$.base| .cse7 v_DerPreprocessor_32))) (and (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse7)) (= .cse7 (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_38) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_38)) (= .cse7 .cse4) (= .cse7 (select (select .cse8 v_arrayElimIndex_38) (_ bv4 32))) (= (_ bv0 32) (select .cse9 (_ bv4 32))) (= (_ bv0 32) (select .cse9 (_ bv0 32))) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (= v_arrayElimIndex_40 .cse7) (= .cse7 (select (select .cse8 v_arrayElimIndex_40) (_ bv0 32))) (not (= v_arrayElimIndex_38 .cse7)) (= (select v_DerPreprocessor_32 (_ bv4 32)) .cse7) (not (= (_ bv0 32) v_arrayElimIndex_38)) (= .cse7 (select (select |c_#memory_$Pointer$.base| .cse7) (_ bv4 32))))))) .cse5))))) is different from true [2024-11-25 02:19:29,675 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse26 (= (_ bv0 32) (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (exists ((v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_38 (_ BitVec 32)) (v_DerPreprocessor_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_33 (_ BitVec 32)) (v_arrayElimIndex_40 (_ BitVec 32)) (v_DerPreprocessor_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_40))) (let ((.cse13 (select .cse12 (_ bv4 32)))) (let ((.cse11 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_34) v_DerPreprocessor_33 v_DerPreprocessor_35) .cse13 v_DerPreprocessor_36))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_41) .cse8 v_DerPreprocessor_42) .cse13 v_DerPreprocessor_43))) (let ((.cse4 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_38)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_38)) (.cse3 (select .cse12 (_ bv0 32))) (.cse10 (select |c_#memory_$Pointer$.offset| .cse8))) (and (= (store .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse2) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)) (= .cse3 (select .cse4 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_38)) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (= v_DerPreprocessor_42 (select .cse7 .cse8)) (= (select .cse4 (_ bv4 32)) .cse3) (= (_ bv0 32) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (_ bv0 32) (select .cse9 (_ bv4 32))) (= (_ bv0 32) (select .cse9 (_ bv0 32))) (= v_arrayElimIndex_40 .cse3) (not (= v_arrayElimIndex_38 .cse3)) (= (_ bv0 32) (select .cse10 (_ bv0 32))) (= .cse8 .cse3) (= v_DerPreprocessor_35 (select .cse11 .cse8)) (= .cse8 v_DerPreprocessor_33) (not (= (_ bv0 32) v_arrayElimIndex_38)) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse3) (_ bv4 32))) (= (_ bv0 32) (select .cse10 (_ bv4 32)))))))))))) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse18 (select .cse17 (_ bv4 32)))) (let ((.cse25 (select |c_#memory_$Pointer$.base| .cse18))) (let ((.cse24 (select .cse25 (_ bv4 32)))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse24 v_DerPreprocessor_23))) (let ((.cse23 (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse15 (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse15 v_DerPreprocessor_27) .cse24 v_DerPreprocessor_28))) (let ((.cse16 (select .cse25 (_ bv0 32))) (.cse20 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse21 (select |c_#memory_$Pointer$.offset| .cse15)) (.cse19 (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse14 .cse15) v_DerPreprocessor_22) (= .cse16 (select .cse17 (_ bv0 32))) (= .cse18 .cse16) (= .cse15 .cse16) (= (_ bv0 32) (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse16)) (= (_ bv0 32) (select .cse20 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= .cse15 v_DerPreprocessor_20) (= (select .cse20 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse21 (_ bv4 32))) (= (select .cse22 .cse15) v_DerPreprocessor_27) (= (select .cse21 (_ bv0 32)) (_ bv0 32)) (= (store .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse24 .cse18) (= (store .cse19 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse2)))))))))))) (= (_ bv0 32) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse26 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse33 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse27 (select .cse33 (_ bv0 32))) (.cse31 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse30 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse29 (select .cse33 (_ bv4 32))) (.cse28 (select .cse31 (_ bv4 32))) (.cse32 (select |c_#memory_$Pointer$.offset| .cse27))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse27 .cse28) (= v_arrayElimIndex_18 .cse29) (= (_ bv0 32) (select .cse30 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse27)) (= (select .cse30 (_ bv4 32)) (_ bv0 32)) (= .cse27 (select .cse31 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse29 .cse28) (= (_ bv0 32) (select .cse32 (_ bv0 32))) (= (select .cse32 (_ bv4 32)) (_ bv0 32)) (not (= .cse27 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse37 (select .cse36 (_ bv4 32)))) (let ((.cse42 (select |c_#memory_$Pointer$.base| .cse37))) (let ((.cse39 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse42 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse34 (select .cse39 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse40 (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse38 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse35 (select .cse42 (_ bv0 32))) (.cse41 (select |c_#memory_$Pointer$.offset| .cse40))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse34 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (= .cse35 (select .cse36 (_ bv0 32))) (= .cse37 .cse35) (not (= v_arrayElimCell_14 .cse35)) (= (_ bv0 32) (select .cse38 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse39 .cse40)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse35)) (= v_DerPreprocessor_4 .cse40) (= .cse40 .cse35) (= (select .cse38 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse41 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse35) (_ bv4 32)) .cse37) (= (_ bv0 32) (select .cse41 (_ bv4 32)))))))))))) .cse26))))) is different from false [2024-11-25 02:19:30,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse26 (= (_ bv0 32) (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (not (exists ((v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_38 (_ BitVec 32)) (v_DerPreprocessor_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_33 (_ BitVec 32)) (v_arrayElimIndex_40 (_ BitVec 32)) (v_DerPreprocessor_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_40))) (let ((.cse13 (select .cse12 (_ bv4 32)))) (let ((.cse11 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_34) v_DerPreprocessor_33 v_DerPreprocessor_35) .cse13 v_DerPreprocessor_36))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_41) .cse8 v_DerPreprocessor_42) .cse13 v_DerPreprocessor_43))) (let ((.cse4 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_38)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_38)) (.cse3 (select .cse12 (_ bv0 32))) (.cse10 (select |c_#memory_$Pointer$.offset| .cse8))) (and (= (store .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse2) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)) (= .cse3 (select .cse4 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_38)) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (= v_DerPreprocessor_42 (select .cse7 .cse8)) (= (select .cse4 (_ bv4 32)) .cse3) (= (_ bv0 32) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (_ bv0 32) (select .cse9 (_ bv4 32))) (= (_ bv0 32) (select .cse9 (_ bv0 32))) (= v_arrayElimIndex_40 .cse3) (not (= v_arrayElimIndex_38 .cse3)) (= (_ bv0 32) (select .cse10 (_ bv0 32))) (= .cse8 .cse3) (= v_DerPreprocessor_35 (select .cse11 .cse8)) (= .cse8 v_DerPreprocessor_33) (not (= (_ bv0 32) v_arrayElimIndex_38)) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse3) (_ bv4 32))) (= (_ bv0 32) (select .cse10 (_ bv4 32))))))))))))) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse18 (select .cse17 (_ bv4 32)))) (let ((.cse25 (select |c_#memory_$Pointer$.base| .cse18))) (let ((.cse24 (select .cse25 (_ bv4 32)))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse24 v_DerPreprocessor_23))) (let ((.cse23 (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse15 (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse15 v_DerPreprocessor_27) .cse24 v_DerPreprocessor_28))) (let ((.cse16 (select .cse25 (_ bv0 32))) (.cse20 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse21 (select |c_#memory_$Pointer$.offset| .cse15)) (.cse19 (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse14 .cse15) v_DerPreprocessor_22) (= .cse16 (select .cse17 (_ bv0 32))) (= .cse18 .cse16) (= .cse15 .cse16) (= (_ bv0 32) (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse16)) (= (_ bv0 32) (select .cse20 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= .cse15 v_DerPreprocessor_20) (= (select .cse20 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse21 (_ bv4 32))) (= (select .cse22 .cse15) v_DerPreprocessor_27) (= (select .cse21 (_ bv0 32)) (_ bv0 32)) (= (store .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse24 .cse18) (= (store .cse19 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse2)))))))))))) (= (_ bv0 32) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse26 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse33 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse27 (select .cse33 (_ bv0 32))) (.cse31 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse30 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse29 (select .cse33 (_ bv4 32))) (.cse28 (select .cse31 (_ bv4 32))) (.cse32 (select |c_#memory_$Pointer$.offset| .cse27))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse27 .cse28) (= v_arrayElimIndex_18 .cse29) (= (_ bv0 32) (select .cse30 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse27)) (= (select .cse30 (_ bv4 32)) (_ bv0 32)) (= .cse27 (select .cse31 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse29 .cse28) (= (_ bv0 32) (select .cse32 (_ bv0 32))) (= (select .cse32 (_ bv4 32)) (_ bv0 32)) (not (= .cse27 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse37 (select .cse36 (_ bv4 32)))) (let ((.cse42 (select |c_#memory_$Pointer$.base| .cse37))) (let ((.cse39 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse42 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse34 (select .cse39 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse40 (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse38 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse35 (select .cse42 (_ bv0 32))) (.cse41 (select |c_#memory_$Pointer$.offset| .cse40))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse34 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (= .cse35 (select .cse36 (_ bv0 32))) (= .cse37 .cse35) (not (= v_arrayElimCell_14 .cse35)) (= (_ bv0 32) (select .cse38 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse39 .cse40)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse35)) (= v_DerPreprocessor_4 .cse40) (= .cse40 .cse35) (= (select .cse38 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse41 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse35) (_ bv4 32)) .cse37) (= (_ bv0 32) (select .cse41 (_ bv4 32)))))))))))) .cse26))))) is different from false [2024-11-25 02:19:31,128 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse26 (= (_ bv0 32) (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (exists ((v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_38 (_ BitVec 32)) (v_DerPreprocessor_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_33 (_ BitVec 32)) (v_arrayElimIndex_40 (_ BitVec 32)) (v_DerPreprocessor_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_40))) (let ((.cse13 (select .cse12 (_ bv4 32)))) (let ((.cse11 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_34) v_DerPreprocessor_33 v_DerPreprocessor_35) .cse13 v_DerPreprocessor_36))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_41) .cse8 v_DerPreprocessor_42) .cse13 v_DerPreprocessor_43))) (let ((.cse4 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_38)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_38)) (.cse3 (select .cse12 (_ bv0 32))) (.cse10 (select |c_#memory_$Pointer$.offset| .cse8))) (and (= (store .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse2) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)) (= .cse3 (select .cse4 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_38)) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (= v_DerPreprocessor_42 (select .cse7 .cse8)) (= (select .cse4 (_ bv4 32)) .cse3) (= (_ bv0 32) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (_ bv0 32) (select .cse9 (_ bv4 32))) (= (_ bv0 32) (select .cse9 (_ bv0 32))) (= v_arrayElimIndex_40 .cse3) (not (= v_arrayElimIndex_38 .cse3)) (= (_ bv0 32) (select .cse10 (_ bv0 32))) (= .cse8 .cse3) (= v_DerPreprocessor_35 (select .cse11 .cse8)) (= .cse8 v_DerPreprocessor_33) (not (= (_ bv0 32) v_arrayElimIndex_38)) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse3) (_ bv4 32))) (= (_ bv0 32) (select .cse10 (_ bv4 32)))))))))))) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse18 (select .cse17 (_ bv4 32)))) (let ((.cse25 (select |c_#memory_$Pointer$.base| .cse18))) (let ((.cse24 (select .cse25 (_ bv4 32)))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse24 v_DerPreprocessor_23))) (let ((.cse23 (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse15 (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse15 v_DerPreprocessor_27) .cse24 v_DerPreprocessor_28))) (let ((.cse16 (select .cse25 (_ bv0 32))) (.cse20 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse21 (select |c_#memory_$Pointer$.offset| .cse15)) (.cse19 (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse14 .cse15) v_DerPreprocessor_22) (= .cse16 (select .cse17 (_ bv0 32))) (= .cse18 .cse16) (= .cse15 .cse16) (= (_ bv0 32) (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse16)) (= (_ bv0 32) (select .cse20 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= .cse15 v_DerPreprocessor_20) (= (select .cse20 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse21 (_ bv4 32))) (= (select .cse22 .cse15) v_DerPreprocessor_27) (= (select .cse21 (_ bv0 32)) (_ bv0 32)) (= (store .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse24 .cse18) (= (store .cse19 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse2)))))))))))) (= (_ bv0 32) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse26 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse33 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse27 (select .cse33 (_ bv0 32))) (.cse31 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse30 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse29 (select .cse33 (_ bv4 32))) (.cse28 (select .cse31 (_ bv4 32))) (.cse32 (select |c_#memory_$Pointer$.offset| .cse27))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse27 .cse28) (= v_arrayElimIndex_18 .cse29) (= (_ bv0 32) (select .cse30 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse27)) (= (select .cse30 (_ bv4 32)) (_ bv0 32)) (= .cse27 (select .cse31 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse29 .cse28) (= (_ bv0 32) (select .cse32 (_ bv0 32))) (= (select .cse32 (_ bv4 32)) (_ bv0 32)) (not (= .cse27 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse37 (select .cse36 (_ bv4 32)))) (let ((.cse42 (select |c_#memory_$Pointer$.base| .cse37))) (let ((.cse39 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse42 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse34 (select .cse39 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse40 (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse38 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse35 (select .cse42 (_ bv0 32))) (.cse41 (select |c_#memory_$Pointer$.offset| .cse40))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse34 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (= .cse35 (select .cse36 (_ bv0 32))) (= .cse37 .cse35) (not (= v_arrayElimCell_14 .cse35)) (= (_ bv0 32) (select .cse38 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse39 .cse40)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse35)) (= v_DerPreprocessor_4 .cse40) (= .cse40 .cse35) (= (select .cse38 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse41 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse35) (_ bv4 32)) .cse37) (= (_ bv0 32) (select .cse41 (_ bv4 32)))))))))))) .cse26)))))) is different from true [2024-11-25 02:19:31,171 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse26 (= (_ bv0 32) (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (not (exists ((v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_38 (_ BitVec 32)) (v_DerPreprocessor_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_33 (_ BitVec 32)) (v_arrayElimIndex_40 (_ BitVec 32)) (v_DerPreprocessor_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_40))) (let ((.cse13 (select .cse12 (_ bv4 32)))) (let ((.cse11 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_34) v_DerPreprocessor_33 v_DerPreprocessor_35) .cse13 v_DerPreprocessor_36))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_41) .cse8 v_DerPreprocessor_42) .cse13 v_DerPreprocessor_43))) (let ((.cse4 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_38)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_38)) (.cse3 (select .cse12 (_ bv0 32))) (.cse10 (select |c_#memory_$Pointer$.offset| .cse8))) (and (= (store .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse2) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)) (= .cse3 (select .cse4 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_38)) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (= v_DerPreprocessor_42 (select .cse7 .cse8)) (= (select .cse4 (_ bv4 32)) .cse3) (= (_ bv0 32) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (_ bv0 32) (select .cse9 (_ bv4 32))) (= (_ bv0 32) (select .cse9 (_ bv0 32))) (= v_arrayElimIndex_40 .cse3) (not (= v_arrayElimIndex_38 .cse3)) (= (_ bv0 32) (select .cse10 (_ bv0 32))) (= .cse8 .cse3) (= v_DerPreprocessor_35 (select .cse11 .cse8)) (= .cse8 v_DerPreprocessor_33) (not (= (_ bv0 32) v_arrayElimIndex_38)) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse3) (_ bv4 32))) (= (_ bv0 32) (select .cse10 (_ bv4 32))))))))))))) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse18 (select .cse17 (_ bv4 32)))) (let ((.cse25 (select |c_#memory_$Pointer$.base| .cse18))) (let ((.cse24 (select .cse25 (_ bv4 32)))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse24 v_DerPreprocessor_23))) (let ((.cse23 (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse15 (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse15 v_DerPreprocessor_27) .cse24 v_DerPreprocessor_28))) (let ((.cse16 (select .cse25 (_ bv0 32))) (.cse20 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse21 (select |c_#memory_$Pointer$.offset| .cse15)) (.cse19 (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse14 .cse15) v_DerPreprocessor_22) (= .cse16 (select .cse17 (_ bv0 32))) (= .cse18 .cse16) (= .cse15 .cse16) (= (_ bv0 32) (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse16)) (= (_ bv0 32) (select .cse20 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= .cse15 v_DerPreprocessor_20) (= (select .cse20 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse21 (_ bv4 32))) (= (select .cse22 .cse15) v_DerPreprocessor_27) (= (select .cse21 (_ bv0 32)) (_ bv0 32)) (= (store .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse24 .cse18) (= (store .cse19 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse2)))))))))))) (= (_ bv0 32) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse26 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse33 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse27 (select .cse33 (_ bv0 32))) (.cse31 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse30 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse29 (select .cse33 (_ bv4 32))) (.cse28 (select .cse31 (_ bv4 32))) (.cse32 (select |c_#memory_$Pointer$.offset| .cse27))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse27 .cse28) (= v_arrayElimIndex_18 .cse29) (= (_ bv0 32) (select .cse30 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse27)) (= (select .cse30 (_ bv4 32)) (_ bv0 32)) (= .cse27 (select .cse31 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse29 .cse28) (= (_ bv0 32) (select .cse32 (_ bv0 32))) (= (select .cse32 (_ bv4 32)) (_ bv0 32)) (not (= .cse27 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse36 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse37 (select .cse36 (_ bv4 32)))) (let ((.cse42 (select |c_#memory_$Pointer$.base| .cse37))) (let ((.cse39 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse42 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse34 (select .cse39 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse40 (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse38 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse35 (select .cse42 (_ bv0 32))) (.cse41 (select |c_#memory_$Pointer$.offset| .cse40))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse34 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (= .cse35 (select .cse36 (_ bv0 32))) (= .cse37 .cse35) (not (= v_arrayElimCell_14 .cse35)) (= (_ bv0 32) (select .cse38 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse39 .cse40)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse35)) (= v_DerPreprocessor_4 .cse40) (= .cse40 .cse35) (= (select .cse38 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse41 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse35) (_ bv4 32)) .cse37) (= (_ bv0 32) (select .cse41 (_ bv4 32)))))))))))) .cse26)))))) is different from true [2024-11-25 02:19:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:19:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 31 states and 96 transitions. [2024-11-25 02:19:31,205 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 96 transitions. [2024-11-25 02:19:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:19:31,206 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:19:31,206 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:19:31,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:19:31,208 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:19:31,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-25 02:19:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:19:31,989 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:19:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:19:32,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-25 02:19:32,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:19:32,094 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-25 02:19:32,185 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-25 02:19:32,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-11-25 02:19:32,368 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-25 02:19:32,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-25 02:19:32,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-25 02:19:32,410 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:32,410 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2024-11-25 02:19:32,419 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 8 treesize of output 1 [2024-11-25 02:19:32,462 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:32,462 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2024-11-25 02:19:32,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:32,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:19:32,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-25 02:19:32,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:32,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2024-11-25 02:19:32,639 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-25 02:19:32,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 51 [2024-11-25 02:19:32,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-11-25 02:19:32,665 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 12 treesize of output 11 [2024-11-25 02:19:32,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 15 [2024-11-25 02:19:33,223 INFO L349 Elim1Store]: treesize reduction 237, result has 8.5 percent of original size [2024-11-25 02:19:33,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 495 treesize of output 194 [2024-11-25 02:19:33,342 INFO L349 Elim1Store]: treesize reduction 141, result has 6.0 percent of original size [2024-11-25 02:19:33,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 281 treesize of output 223 [2024-11-25 02:19:33,366 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 193 treesize of output 149 [2024-11-25 02:19:33,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:33,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 60 [2024-11-25 02:19:33,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-25 02:19:33,408 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 16 treesize of output 1 [2024-11-25 02:19:34,293 INFO L349 Elim1Store]: treesize reduction 371, result has 6.1 percent of original size [2024-11-25 02:19:34,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 13 new quantified variables, introduced 25 case distinctions, treesize of input 363 treesize of output 327 [2024-11-25 02:19:34,334 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:34,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 258 [2024-11-25 02:19:34,521 INFO L349 Elim1Store]: treesize reduction 69, result has 6.8 percent of original size [2024-11-25 02:19:34,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 304 treesize of output 325 [2024-11-25 02:19:34,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 142 [2024-11-25 02:19:34,694 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-25 02:19:34,720 INFO L349 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2024-11-25 02:19:34,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 202 treesize of output 142 [2024-11-25 02:19:34,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 124 treesize of output 97 [2024-11-25 02:19:34,755 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:34,755 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2024-11-25 02:19:34,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:34,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:34,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:34,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:34,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 14 [2024-11-25 02:19:34,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-11-25 02:19:34,802 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:34,802 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2024-11-25 02:19:34,808 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:35,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:19:35,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-11-25 02:19:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:19:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 31 states and 96 transitions. [2024-11-25 02:19:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 96 transitions. [2024-11-25 02:19:35,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:19:35,622 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:19:35,622 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:19:35,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:19:35,626 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:19:35,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-25 02:19:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:19:36,325 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:19:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:19:36,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-25 02:19:36,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:19:36,438 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-25 02:19:36,538 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-25 02:19:36,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-11-25 02:19:36,714 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-25 02:19:36,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-25 02:19:36,791 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:36,792 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2024-11-25 02:19:36,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:36,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:19:36,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-25 02:19:36,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:36,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:19:36,862 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 8 treesize of output 7 [2024-11-25 02:19:36,929 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-25 02:19:36,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 67 [2024-11-25 02:19:36,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 45 [2024-11-25 02:19:37,470 INFO L349 Elim1Store]: treesize reduction 237, result has 8.5 percent of original size [2024-11-25 02:19:37,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 495 treesize of output 194 [2024-11-25 02:19:37,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:37,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2024-11-25 02:19:37,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2024-11-25 02:19:37,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-11-25 02:19:37,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-25 02:19:37,561 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 15 [2024-11-25 02:19:38,409 INFO L349 Elim1Store]: treesize reduction 375, result has 5.1 percent of original size [2024-11-25 02:19:38,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 13 new quantified variables, introduced 25 case distinctions, treesize of input 363 treesize of output 323 [2024-11-25 02:19:38,442 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:38,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 250 [2024-11-25 02:19:38,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:38,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 208 [2024-11-25 02:19:38,638 INFO L349 Elim1Store]: treesize reduction 85, result has 5.6 percent of original size [2024-11-25 02:19:38,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 295 [2024-11-25 02:19:38,741 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-25 02:19:38,763 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-25 02:19:38,763 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 267 treesize of output 199 [2024-11-25 02:19:38,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 185 treesize of output 146 [2024-11-25 02:19:38,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:38,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:38,795 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:38,796 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:38,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 14 [2024-11-25 02:19:38,808 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:38,808 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2024-11-25 02:19:38,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:38,822 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:38,822 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2024-11-25 02:19:38,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:38,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-11-25 02:19:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:19:39,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-25 02:19:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:19:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 31 states and 96 transitions. [2024-11-25 02:19:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 96 transitions. [2024-11-25 02:19:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:19:39,346 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:19:39,346 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:19:39,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:19:39,348 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:19:39,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-25 02:19:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:19:40,034 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:19:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:19:40,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-25 02:19:40,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:19:40,129 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-25 02:19:40,215 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-25 02:19:40,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-11-25 02:19:40,411 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-25 02:19:40,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-25 02:19:40,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:40,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:19:40,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-25 02:19:40,485 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:40,485 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2024-11-25 02:19:40,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-25 02:19:40,498 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:40,499 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2024-11-25 02:19:40,507 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 8 treesize of output 1 [2024-11-25 02:19:40,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 42 [2024-11-25 02:19:40,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:40,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 42 [2024-11-25 02:19:40,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2024-11-25 02:19:40,715 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 12 treesize of output 11 [2024-11-25 02:19:40,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 31 [2024-11-25 02:19:41,093 INFO L349 Elim1Store]: treesize reduction 237, result has 8.5 percent of original size [2024-11-25 02:19:41,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 495 treesize of output 194 [2024-11-25 02:19:41,102 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:41,104 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 537 [2024-11-25 02:19:41,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:41,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 78 [2024-11-25 02:19:41,142 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 48 treesize of output 1 [2024-11-25 02:19:41,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-25 02:19:43,991 INFO L349 Elim1Store]: treesize reduction 1287, result has 3.2 percent of original size [2024-11-25 02:19:43,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 12 select indices, 12 select index equivalence classes, 2 disjoint index pairs (out of 66 index pairs), introduced 21 new quantified variables, introduced 88 case distinctions, treesize of input 15113 treesize of output 13257 [2024-11-25 02:19:44,566 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:44,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 230 [2024-11-25 02:19:44,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:44,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 200 [2024-11-25 02:19:44,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:44,938 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:44,940 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:44,942 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:44,944 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:44,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:44,952 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:44,954 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:45,085 INFO L349 Elim1Store]: treesize reduction 69, result has 6.8 percent of original size [2024-11-25 02:19:45,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 9 select indices, 9 select index equivalence classes, 4 disjoint index pairs (out of 36 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 682 treesize of output 605 [2024-11-25 02:19:46,497 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:46,498 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2024-11-25 02:19:46,611 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:47,122 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-25 02:19:47,122 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 220 treesize of output 190 [2024-11-25 02:19:47,661 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-25 02:19:47,662 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 222 treesize of output 174 [2024-11-25 02:19:47,982 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-25 02:19:47,982 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 178 treesize of output 156 [2024-11-25 02:19:48,168 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-25 02:19:48,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:48,394 INFO L349 Elim1Store]: treesize reduction 61, result has 1.6 percent of original size [2024-11-25 02:19:48,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 92 [2024-11-25 02:19:48,396 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-25 02:19:48,403 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:48,404 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2024-11-25 02:19:48,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 150 treesize of output 129 [2024-11-25 02:19:48,427 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 157 treesize of output 135 [2024-11-25 02:19:48,436 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:48,437 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2024-11-25 02:19:48,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:49,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:49,122 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:49,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2024-11-25 02:19:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:19:49,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-25 02:19:49,727 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) (exists ((v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse1 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse2 (select .cse1 (_ bv4 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) (_ bv0 32)))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse0 (select .cse1 (_ bv0 32))) (= .cse2 .cse0) (not (= v_arrayElimCell_14 .cse0)) (= (_ bv0 32) (select .cse3 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (= .cse0 .cse4) (= (select .cse3 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) (_ bv0 32)) (_ bv0 32)) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse0) (_ bv4 32)) .cse2) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| .cse0) (_ bv4 32)))))))) (not (and (exists ((v_DerPreprocessor_60 (_ BitVec 32)) (v_DerPreprocessor_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_62 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_59 (_ BitVec 32)) (v_arrayElimCell_265 (_ BitVec 32))) (let ((.cse8 (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_59 v_DerPreprocessor_61) v_DerPreprocessor_60 v_DerPreprocessor_62))) (let ((.cse9 (select .cse8 v_arrayElimCell_265))) (let ((.cse5 (select .cse9 (_ bv0 32)))) (let ((.cse10 (select .cse8 .cse5))) (let ((.cse7 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_265)) (.cse6 (select .cse10 (_ bv4 32)))) (and (= .cse5 v_DerPreprocessor_59) (= .cse5 (select (select |c_#memory_$Pointer$.base| .cse6) (_ bv0 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| .cse5) (_ bv4 32))) (= (_ bv0 32) (select .cse7 (_ bv0 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| .cse6) (_ bv0 32))) (not (= v_arrayElimCell_265 .cse5)) (not (= v_arrayElimCell_265 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse5)) (= .cse5 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select .cse9 (_ bv4 32)) .cse6) (= (_ bv0 32) (select .cse7 (_ bv4 32))) (= .cse10 v_DerPreprocessor_61) (= (select (select .cse8 .cse6) (_ bv0 32)) .cse6) (= (select (select |c_#memory_$Pointer$.base| .cse5) (_ bv4 32)) .cse6) (= .cse5 .cse6) (= .cse6 v_DerPreprocessor_60) (not (= v_arrayElimCell_265 (_ bv0 32)))))))))) .cse11)) .cse11 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|) (not (and (exists ((v_arrayElimIndex_38 (_ BitVec 32)) (v_arrayElimIndex_40 (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_40) (_ bv0 32)))) (let ((.cse15 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_38)) (.cse12 (select |c_#memory_$Pointer$.offset| .cse13)) (.cse14 (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_32))) (and (= (select .cse12 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse13)) (= .cse13 (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_38) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_38)) (= .cse13 .cse4) (= .cse13 (select (select .cse14 v_arrayElimIndex_38) (_ bv4 32))) (= (_ bv0 32) (select .cse15 (_ bv4 32))) (= (_ bv0 32) (select .cse15 (_ bv0 32))) (= (_ bv0 32) (select .cse12 (_ bv0 32))) (= v_arrayElimIndex_40 .cse13) (= .cse13 (select (select .cse14 v_arrayElimIndex_40) (_ bv0 32))) (not (= v_arrayElimIndex_38 .cse13)) (= (select v_DerPreprocessor_32 (_ bv4 32)) .cse13) (not (= (_ bv0 32) v_arrayElimIndex_38)) (= .cse13 (select (select |c_#memory_$Pointer$.base| .cse13) (_ bv4 32))))))) .cse11)))) is different from false [2024-11-25 02:19:49,764 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) (exists ((v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse1 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse2 (select .cse1 (_ bv4 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse0 (select (select |c_#memory_$Pointer$.base| .cse2) (_ bv0 32)))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse0 (select .cse1 (_ bv0 32))) (= .cse2 .cse0) (not (= v_arrayElimCell_14 .cse0)) (= (_ bv0 32) (select .cse3 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (= .cse0 .cse4) (= (select .cse3 (_ bv4 32)) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| .cse2) (_ bv0 32)) (_ bv0 32)) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse0) (_ bv4 32)) .cse2) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| .cse0) (_ bv4 32)))))))) (not (and (exists ((v_DerPreprocessor_60 (_ BitVec 32)) (v_DerPreprocessor_61 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_62 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_59 (_ BitVec 32)) (v_arrayElimCell_265 (_ BitVec 32))) (let ((.cse8 (store (store |c_#memory_$Pointer$.base| v_DerPreprocessor_59 v_DerPreprocessor_61) v_DerPreprocessor_60 v_DerPreprocessor_62))) (let ((.cse9 (select .cse8 v_arrayElimCell_265))) (let ((.cse5 (select .cse9 (_ bv0 32)))) (let ((.cse10 (select .cse8 .cse5))) (let ((.cse7 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_265)) (.cse6 (select .cse10 (_ bv4 32)))) (and (= .cse5 v_DerPreprocessor_59) (= .cse5 (select (select |c_#memory_$Pointer$.base| .cse6) (_ bv0 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| .cse5) (_ bv4 32))) (= (_ bv0 32) (select .cse7 (_ bv0 32))) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.offset| .cse6) (_ bv0 32))) (not (= v_arrayElimCell_265 .cse5)) (not (= v_arrayElimCell_265 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse5)) (= .cse5 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select .cse9 (_ bv4 32)) .cse6) (= (_ bv0 32) (select .cse7 (_ bv4 32))) (= .cse10 v_DerPreprocessor_61) (= (select (select .cse8 .cse6) (_ bv0 32)) .cse6) (= (select (select |c_#memory_$Pointer$.base| .cse5) (_ bv4 32)) .cse6) (= .cse5 .cse6) (= .cse6 v_DerPreprocessor_60) (not (= v_arrayElimCell_265 (_ bv0 32)))))))))) .cse11)) .cse11 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|) (not (and (exists ((v_arrayElimIndex_38 (_ BitVec 32)) (v_arrayElimIndex_40 (_ BitVec 32)) (v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_40) (_ bv0 32)))) (let ((.cse15 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_38)) (.cse12 (select |c_#memory_$Pointer$.offset| .cse13)) (.cse14 (store |c_#memory_$Pointer$.base| .cse13 v_DerPreprocessor_32))) (and (= (select .cse12 (_ bv4 32)) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse13)) (= .cse13 (select (select |c_#memory_$Pointer$.base| v_arrayElimIndex_38) (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_38)) (= .cse13 .cse4) (= .cse13 (select (select .cse14 v_arrayElimIndex_38) (_ bv4 32))) (= (_ bv0 32) (select .cse15 (_ bv4 32))) (= (_ bv0 32) (select .cse15 (_ bv0 32))) (= (_ bv0 32) (select .cse12 (_ bv0 32))) (= v_arrayElimIndex_40 .cse13) (= .cse13 (select (select .cse14 v_arrayElimIndex_40) (_ bv0 32))) (not (= v_arrayElimIndex_38 .cse13)) (= (select v_DerPreprocessor_32 (_ bv4 32)) .cse13) (not (= (_ bv0 32) v_arrayElimIndex_38)) (= .cse13 (select (select |c_#memory_$Pointer$.base| .cse13) (_ bv4 32))))))) .cse11))))) is different from true [2024-11-25 02:19:49,788 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse14 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse24 (= (_ bv0 32) (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse4 (select .cse3 (_ bv4 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse11 (select .cse13 (_ bv4 32)))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse11 v_DerPreprocessor_23))) (let ((.cse9 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse1 v_DerPreprocessor_27) .cse11 v_DerPreprocessor_28))) (let ((.cse2 (select .cse13 (_ bv0 32))) (.cse6 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse0 .cse1) v_DerPreprocessor_22) (= .cse2 (select .cse3 (_ bv0 32))) (= .cse4 .cse2) (= .cse1 .cse2) (= (_ bv0 32) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse2)) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2)) (= .cse1 v_DerPreprocessor_20) (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse7 (_ bv4 32))) (= (select .cse8 .cse1) v_DerPreprocessor_27) (= (select .cse7 (_ bv0 32)) (_ bv0 32)) (= (store .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse11 .cse4) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12))))))))))))) (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (exists ((v_DerPreprocessor_67 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_265 (_ BitVec 32))) (let ((.cse23 (select |c_#memory_$Pointer$.base| v_arrayElimCell_265))) (let ((.cse17 (select .cse23 (_ bv4 32)))) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse17))) (let ((.cse19 (select .cse23 (_ bv0 32))) (.cse16 (select .cse21 (_ bv4 32)))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_65) .cse19 v_DerPreprocessor_66) .cse16 v_DerPreprocessor_67))) (let ((.cse15 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_265)) (.cse20 (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse18 (select |c_#memory_$Pointer$.offset| .cse19))) (and (= (_ bv0 32) (select .cse15 (_ bv0 32))) (= .cse16 .cse17) (= (_ bv0 32) (select .cse18 (_ bv0 32))) (not (= v_arrayElimCell_265 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_265 .cse19)) (= (store .cse20 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12) (= .cse19 (select .cse21 (_ bv0 32))) (= (_ bv0 32) (select .cse15 (_ bv4 32))) (= (_ bv0 32) (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse19 .cse17) (= (_ bv0 32) (select .cse18 (_ bv4 32))) (= v_DerPreprocessor_66 (select .cse22 .cse19)) (not (= v_arrayElimCell_265 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse19)))))))))) (= (_ bv0 32) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse24 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse31 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse25 (select .cse31 (_ bv0 32))) (.cse29 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse28 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse27 (select .cse31 (_ bv4 32))) (.cse26 (select .cse29 (_ bv4 32))) (.cse30 (select |c_#memory_$Pointer$.offset| .cse25))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse25 .cse26) (= v_arrayElimIndex_18 .cse27) (= (_ bv0 32) (select .cse28 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse25)) (= (select .cse28 (_ bv4 32)) (_ bv0 32)) (= .cse25 (select .cse29 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse27 .cse26) (= (_ bv0 32) (select .cse30 (_ bv0 32))) (= (select .cse30 (_ bv4 32)) (_ bv0 32)) (not (= .cse25 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse35 (select .cse34 (_ bv4 32)))) (let ((.cse40 (select |c_#memory_$Pointer$.base| .cse35))) (let ((.cse37 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse40 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse32 (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse38 (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse36 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse33 (select .cse40 (_ bv0 32))) (.cse39 (select |c_#memory_$Pointer$.offset| .cse38))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse32 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (= .cse33 (select .cse34 (_ bv0 32))) (= .cse35 .cse33) (not (= v_arrayElimCell_14 .cse33)) (= (_ bv0 32) (select .cse36 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse37 .cse38)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse33)) (= v_DerPreprocessor_4 .cse38) (= .cse38 .cse33) (= (select .cse36 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse39 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse33) (_ bv4 32)) .cse35) (= (_ bv0 32) (select .cse39 (_ bv4 32)))))))))))) .cse24))))) is different from false [2024-11-25 02:19:50,391 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse24 (= (_ bv0 32) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse14 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse25 (= (_ bv0 32) (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse4 (select .cse3 (_ bv4 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse11 (select .cse13 (_ bv4 32)))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse11 v_DerPreprocessor_23))) (let ((.cse9 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse1 v_DerPreprocessor_27) .cse11 v_DerPreprocessor_28))) (let ((.cse2 (select .cse13 (_ bv0 32))) (.cse6 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse0 .cse1) v_DerPreprocessor_22) (= .cse2 (select .cse3 (_ bv0 32))) (= .cse4 .cse2) (= .cse1 .cse2) (= (_ bv0 32) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse2)) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2)) (= .cse1 v_DerPreprocessor_20) (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse7 (_ bv4 32))) (= (select .cse8 .cse1) v_DerPreprocessor_27) (= (select .cse7 (_ bv0 32)) (_ bv0 32)) (= (store .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse11 .cse4) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12))))))))))))) (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (not (and (exists ((v_DerPreprocessor_67 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_265 (_ BitVec 32))) (let ((.cse23 (select |c_#memory_$Pointer$.base| v_arrayElimCell_265))) (let ((.cse17 (select .cse23 (_ bv4 32)))) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse17))) (let ((.cse19 (select .cse23 (_ bv0 32))) (.cse16 (select .cse21 (_ bv4 32)))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_65) .cse19 v_DerPreprocessor_66) .cse16 v_DerPreprocessor_67))) (let ((.cse15 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_265)) (.cse20 (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse18 (select |c_#memory_$Pointer$.offset| .cse19))) (and (= (_ bv0 32) (select .cse15 (_ bv0 32))) (= .cse16 .cse17) (= (_ bv0 32) (select .cse18 (_ bv0 32))) (not (= v_arrayElimCell_265 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_265 .cse19)) (= (store .cse20 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12) (= .cse19 (select .cse21 (_ bv0 32))) (= (_ bv0 32) (select .cse15 (_ bv4 32))) (= (_ bv0 32) (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse19 .cse17) (= (_ bv0 32) (select .cse18 (_ bv4 32))) (= v_DerPreprocessor_66 (select .cse22 .cse19)) (not (= v_arrayElimCell_265 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse19)))))))))) .cse24)) .cse24 .cse25 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse32 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse26 (select .cse32 (_ bv0 32))) (.cse30 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse29 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse28 (select .cse32 (_ bv4 32))) (.cse27 (select .cse30 (_ bv4 32))) (.cse31 (select |c_#memory_$Pointer$.offset| .cse26))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse26 .cse27) (= v_arrayElimIndex_18 .cse28) (= (_ bv0 32) (select .cse29 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse26)) (= (select .cse29 (_ bv4 32)) (_ bv0 32)) (= .cse26 (select .cse30 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse28 .cse27) (= (_ bv0 32) (select .cse31 (_ bv0 32))) (= (select .cse31 (_ bv4 32)) (_ bv0 32)) (not (= .cse26 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse36 (select .cse35 (_ bv4 32)))) (let ((.cse41 (select |c_#memory_$Pointer$.base| .cse36))) (let ((.cse38 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse41 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse33 (select .cse38 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse39 (select .cse33 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse37 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse34 (select .cse41 (_ bv0 32))) (.cse40 (select |c_#memory_$Pointer$.offset| .cse39))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse33 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (= .cse34 (select .cse35 (_ bv0 32))) (= .cse36 .cse34) (not (= v_arrayElimCell_14 .cse34)) (= (_ bv0 32) (select .cse37 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse38 .cse39)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse34)) (= v_DerPreprocessor_4 .cse39) (= .cse39 .cse34) (= (select .cse37 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse40 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse34) (_ bv4 32)) .cse36) (= (_ bv0 32) (select .cse40 (_ bv4 32)))))))))))) .cse25))))) is different from false [2024-11-25 02:19:50,431 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse14 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse24 (= (_ bv0 32) (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse4 (select .cse3 (_ bv4 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse11 (select .cse13 (_ bv4 32)))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse11 v_DerPreprocessor_23))) (let ((.cse9 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse1 v_DerPreprocessor_27) .cse11 v_DerPreprocessor_28))) (let ((.cse2 (select .cse13 (_ bv0 32))) (.cse6 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse0 .cse1) v_DerPreprocessor_22) (= .cse2 (select .cse3 (_ bv0 32))) (= .cse4 .cse2) (= .cse1 .cse2) (= (_ bv0 32) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse2)) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2)) (= .cse1 v_DerPreprocessor_20) (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse7 (_ bv4 32))) (= (select .cse8 .cse1) v_DerPreprocessor_27) (= (select .cse7 (_ bv0 32)) (_ bv0 32)) (= (store .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse11 .cse4) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12))))))))))))) (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (exists ((v_DerPreprocessor_67 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_265 (_ BitVec 32))) (let ((.cse23 (select |c_#memory_$Pointer$.base| v_arrayElimCell_265))) (let ((.cse17 (select .cse23 (_ bv4 32)))) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse17))) (let ((.cse19 (select .cse23 (_ bv0 32))) (.cse16 (select .cse21 (_ bv4 32)))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_65) .cse19 v_DerPreprocessor_66) .cse16 v_DerPreprocessor_67))) (let ((.cse15 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_265)) (.cse20 (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse18 (select |c_#memory_$Pointer$.offset| .cse19))) (and (= (_ bv0 32) (select .cse15 (_ bv0 32))) (= .cse16 .cse17) (= (_ bv0 32) (select .cse18 (_ bv0 32))) (not (= v_arrayElimCell_265 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_265 .cse19)) (= (store .cse20 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12) (= .cse19 (select .cse21 (_ bv0 32))) (= (_ bv0 32) (select .cse15 (_ bv4 32))) (= (_ bv0 32) (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse19 .cse17) (= (_ bv0 32) (select .cse18 (_ bv4 32))) (= v_DerPreprocessor_66 (select .cse22 .cse19)) (not (= v_arrayElimCell_265 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse19)))))))))) (= (_ bv0 32) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse24 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse31 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse25 (select .cse31 (_ bv0 32))) (.cse29 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse28 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse27 (select .cse31 (_ bv4 32))) (.cse26 (select .cse29 (_ bv4 32))) (.cse30 (select |c_#memory_$Pointer$.offset| .cse25))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse25 .cse26) (= v_arrayElimIndex_18 .cse27) (= (_ bv0 32) (select .cse28 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse25)) (= (select .cse28 (_ bv4 32)) (_ bv0 32)) (= .cse25 (select .cse29 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse27 .cse26) (= (_ bv0 32) (select .cse30 (_ bv0 32))) (= (select .cse30 (_ bv4 32)) (_ bv0 32)) (not (= .cse25 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse34 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse35 (select .cse34 (_ bv4 32)))) (let ((.cse40 (select |c_#memory_$Pointer$.base| .cse35))) (let ((.cse37 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse40 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse32 (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse38 (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse36 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse33 (select .cse40 (_ bv0 32))) (.cse39 (select |c_#memory_$Pointer$.offset| .cse38))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse32 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (= .cse33 (select .cse34 (_ bv0 32))) (= .cse35 .cse33) (not (= v_arrayElimCell_14 .cse33)) (= (_ bv0 32) (select .cse36 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse37 .cse38)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse33)) (= v_DerPreprocessor_4 .cse38) (= .cse38 .cse33) (= (select .cse36 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse39 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse33) (_ bv4 32)) .cse35) (= (_ bv0 32) (select .cse39 (_ bv4 32)))))))))))) .cse24)))))) is different from true [2024-11-25 02:19:50,470 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse24 (= (_ bv0 32) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse14 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse25 (= (_ bv0 32) (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse4 (select .cse3 (_ bv4 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse11 (select .cse13 (_ bv4 32)))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse11 v_DerPreprocessor_23))) (let ((.cse9 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse1 v_DerPreprocessor_27) .cse11 v_DerPreprocessor_28))) (let ((.cse2 (select .cse13 (_ bv0 32))) (.cse6 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse0 .cse1) v_DerPreprocessor_22) (= .cse2 (select .cse3 (_ bv0 32))) (= .cse4 .cse2) (= .cse1 .cse2) (= (_ bv0 32) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse2)) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2)) (= .cse1 v_DerPreprocessor_20) (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse7 (_ bv4 32))) (= (select .cse8 .cse1) v_DerPreprocessor_27) (= (select .cse7 (_ bv0 32)) (_ bv0 32)) (= (store .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse11 .cse4) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12))))))))))))) (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (not (and (exists ((v_DerPreprocessor_67 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_265 (_ BitVec 32))) (let ((.cse23 (select |c_#memory_$Pointer$.base| v_arrayElimCell_265))) (let ((.cse17 (select .cse23 (_ bv4 32)))) (let ((.cse21 (select |c_#memory_$Pointer$.base| .cse17))) (let ((.cse19 (select .cse23 (_ bv0 32))) (.cse16 (select .cse21 (_ bv4 32)))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_65) .cse19 v_DerPreprocessor_66) .cse16 v_DerPreprocessor_67))) (let ((.cse15 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_265)) (.cse20 (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse18 (select |c_#memory_$Pointer$.offset| .cse19))) (and (= (_ bv0 32) (select .cse15 (_ bv0 32))) (= .cse16 .cse17) (= (_ bv0 32) (select .cse18 (_ bv0 32))) (not (= v_arrayElimCell_265 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_265 .cse19)) (= (store .cse20 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12) (= .cse19 (select .cse21 (_ bv0 32))) (= (_ bv0 32) (select .cse15 (_ bv4 32))) (= (_ bv0 32) (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse19 .cse17) (= (_ bv0 32) (select .cse18 (_ bv4 32))) (= v_DerPreprocessor_66 (select .cse22 .cse19)) (not (= v_arrayElimCell_265 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse19)))))))))) .cse24)) .cse24 .cse25 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse32 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse26 (select .cse32 (_ bv0 32))) (.cse30 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse29 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse28 (select .cse32 (_ bv4 32))) (.cse27 (select .cse30 (_ bv4 32))) (.cse31 (select |c_#memory_$Pointer$.offset| .cse26))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse26 .cse27) (= v_arrayElimIndex_18 .cse28) (= (_ bv0 32) (select .cse29 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse26)) (= (select .cse29 (_ bv4 32)) (_ bv0 32)) (= .cse26 (select .cse30 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse28 .cse27) (= (_ bv0 32) (select .cse31 (_ bv0 32))) (= (select .cse31 (_ bv4 32)) (_ bv0 32)) (not (= .cse26 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse36 (select .cse35 (_ bv4 32)))) (let ((.cse41 (select |c_#memory_$Pointer$.base| .cse36))) (let ((.cse38 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse41 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse33 (select .cse38 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse39 (select .cse33 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse37 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse34 (select .cse41 (_ bv0 32))) (.cse40 (select |c_#memory_$Pointer$.offset| .cse39))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse33 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (= .cse34 (select .cse35 (_ bv0 32))) (= .cse36 .cse34) (not (= v_arrayElimCell_14 .cse34)) (= (_ bv0 32) (select .cse37 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse38 .cse39)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse34)) (= v_DerPreprocessor_4 .cse39) (= .cse39 .cse34) (= (select .cse37 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse40 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse34) (_ bv4 32)) .cse36) (= (_ bv0 32) (select .cse40 (_ bv4 32)))))))))))) .cse25)))))) is different from true [2024-11-25 02:19:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:19:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 32 states and 114 transitions. [2024-11-25 02:19:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2024-11-25 02:19:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:19:50,500 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:19:50,500 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:19:50,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:19:50,504 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:19:50,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-25 02:19:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:19:51,258 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:19:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:19:51,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-25 02:19:51,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:19:51,359 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-25 02:19:51,447 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-25 02:19:51,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-11-25 02:19:51,638 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-25 02:19:51,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-25 02:19:51,714 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:51,714 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2024-11-25 02:19:51,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:51,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:19:51,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-25 02:19:51,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:51,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:19:51,758 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 8 treesize of output 7 [2024-11-25 02:19:51,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 45 [2024-11-25 02:19:51,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 42 [2024-11-25 02:19:52,248 INFO L349 Elim1Store]: treesize reduction 237, result has 8.5 percent of original size [2024-11-25 02:19:52,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 495 treesize of output 194 [2024-11-25 02:19:52,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:52,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 60 [2024-11-25 02:19:52,296 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:52,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 19 [2024-11-25 02:19:52,311 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 15 [2024-11-25 02:19:52,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-25 02:19:52,336 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 16 treesize of output 1 [2024-11-25 02:19:53,160 INFO L349 Elim1Store]: treesize reduction 373, result has 5.6 percent of original size [2024-11-25 02:19:53,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 13 new quantified variables, introduced 25 case distinctions, treesize of input 363 treesize of output 325 [2024-11-25 02:19:53,187 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:53,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 250 [2024-11-25 02:19:53,352 INFO L349 Elim1Store]: treesize reduction 85, result has 5.6 percent of original size [2024-11-25 02:19:53,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 292 treesize of output 305 [2024-11-25 02:19:53,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:53,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 138 [2024-11-25 02:19:53,491 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-25 02:19:53,519 INFO L349 Elim1Store]: treesize reduction 78, result has 1.3 percent of original size [2024-11-25 02:19:53,519 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 271 treesize of output 203 [2024-11-25 02:19:53,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 189 treesize of output 150 [2024-11-25 02:19:53,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:53,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:53,570 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:53,572 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:53,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 14 [2024-11-25 02:19:53,591 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:53,592 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2024-11-25 02:19:53,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:53,614 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:53,615 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2024-11-25 02:19:53,625 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:53,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-11-25 02:19:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:19:54,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-25 02:19:54,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:19:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 32 states and 114 transitions. [2024-11-25 02:19:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2024-11-25 02:19:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:19:54,266 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:19:54,266 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:19:54,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:19:54,268 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:19:54,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-25 02:19:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:19:55,011 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:19:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:19:55,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-25 02:19:55,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:19:55,118 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-25 02:19:55,215 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-25 02:19:55,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-11-25 02:19:55,410 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-25 02:19:55,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-25 02:19:55,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:55,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:19:55,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-25 02:19:55,516 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:55,516 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2024-11-25 02:19:55,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-25 02:19:55,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-11-25 02:19:55,548 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 8 treesize of output 7 [2024-11-25 02:19:55,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 42 [2024-11-25 02:19:55,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 45 [2024-11-25 02:19:56,124 INFO L349 Elim1Store]: treesize reduction 237, result has 8.5 percent of original size [2024-11-25 02:19:56,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 495 treesize of output 194 [2024-11-25 02:19:56,134 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:56,134 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2024-11-25 02:19:56,145 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 15 [2024-11-25 02:19:56,153 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 16 treesize of output 1 [2024-11-25 02:19:56,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:56,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2024-11-25 02:19:56,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-25 02:19:56,903 INFO L349 Elim1Store]: treesize reduction 375, result has 5.1 percent of original size [2024-11-25 02:19:56,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 13 new quantified variables, introduced 25 case distinctions, treesize of input 363 treesize of output 323 [2024-11-25 02:19:56,925 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:56,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 242 [2024-11-25 02:19:57,025 INFO L349 Elim1Store]: treesize reduction 69, result has 6.8 percent of original size [2024-11-25 02:19:57,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 292 treesize of output 301 [2024-11-25 02:19:57,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 138 [2024-11-25 02:19:57,111 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-25 02:19:57,117 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:57,117 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2024-11-25 02:19:57,127 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:57,136 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:57,137 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 336 [2024-11-25 02:19:57,145 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:57,146 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 201 [2024-11-25 02:19:57,155 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:57,155 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2024-11-25 02:19:57,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:58,780 INFO L349 Elim1Store]: treesize reduction 106, result has 25.9 percent of original size [2024-11-25 02:19:58,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 3595 treesize of output 2650 [2024-11-25 02:19:58,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:58,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:58,900 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:58,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:58,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:19:58,963 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:19:59,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:19:59,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 502 treesize of output 482 [2024-11-25 02:19:59,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 215 [2024-11-25 02:19:59,537 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 0 case distinctions, treesize of input 106 treesize of output 103 [2024-11-25 02:19:59,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-25 02:20:00,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 43 treesize of output 37 [2024-11-25 02:20:00,894 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 22 treesize of output 16 [2024-11-25 02:20:00,907 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 27 treesize of output 17 [2024-11-25 02:20:00,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 17 [2024-11-25 02:20:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:20:00,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-25 02:20:01,345 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse38 (= (_ bv0 32) (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (not (exists ((v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_38 (_ BitVec 32)) (v_DerPreprocessor_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_33 (_ BitVec 32)) (v_arrayElimIndex_40 (_ BitVec 32)) (v_DerPreprocessor_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_40))) (let ((.cse13 (select .cse12 (_ bv4 32)))) (let ((.cse11 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_34) v_DerPreprocessor_33 v_DerPreprocessor_35) .cse13 v_DerPreprocessor_36))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_41) .cse8 v_DerPreprocessor_42) .cse13 v_DerPreprocessor_43))) (let ((.cse4 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_38)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_38)) (.cse3 (select .cse12 (_ bv0 32))) (.cse10 (select |c_#memory_$Pointer$.offset| .cse8))) (and (= (store .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse2) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)) (= .cse3 (select .cse4 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_38)) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (= v_DerPreprocessor_42 (select .cse7 .cse8)) (= (select .cse4 (_ bv4 32)) .cse3) (= (_ bv0 32) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (_ bv0 32) (select .cse9 (_ bv4 32))) (= (_ bv0 32) (select .cse9 (_ bv0 32))) (= v_arrayElimIndex_40 .cse3) (not (= v_arrayElimIndex_38 .cse3)) (= (_ bv0 32) (select .cse10 (_ bv0 32))) (= .cse8 .cse3) (= v_DerPreprocessor_35 (select .cse11 .cse8)) (= .cse8 v_DerPreprocessor_33) (not (= (_ bv0 32) v_arrayElimIndex_38)) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse3) (_ bv4 32))) (= (_ bv0 32) (select .cse10 (_ bv4 32))))))))))))) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse18 (select .cse17 (_ bv4 32)))) (let ((.cse25 (select |c_#memory_$Pointer$.base| .cse18))) (let ((.cse24 (select .cse25 (_ bv4 32)))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse24 v_DerPreprocessor_23))) (let ((.cse23 (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse15 (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse15 v_DerPreprocessor_27) .cse24 v_DerPreprocessor_28))) (let ((.cse16 (select .cse25 (_ bv0 32))) (.cse20 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse21 (select |c_#memory_$Pointer$.offset| .cse15)) (.cse19 (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse14 .cse15) v_DerPreprocessor_22) (= .cse16 (select .cse17 (_ bv0 32))) (= .cse18 .cse16) (= .cse15 .cse16) (= (_ bv0 32) (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse16)) (= (_ bv0 32) (select .cse20 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= .cse15 v_DerPreprocessor_20) (= (select .cse20 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse21 (_ bv4 32))) (= (select .cse22 .cse15) v_DerPreprocessor_27) (= (select .cse21 (_ bv0 32)) (_ bv0 32)) (= (store .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse24 .cse18) (= (store .cse19 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse2)))))))))))) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_79 (_ BitVec 32)) (v_DerPreprocessor_81 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_80 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_83 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_82 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse29 (select .cse27 (_ bv4 32)))) (let ((.cse37 (select |c_#memory_$Pointer$.base| .cse29))) (let ((.cse34 (select .cse37 (_ bv4 32)))) (let ((.cse35 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_80) v_DerPreprocessor_79 v_DerPreprocessor_81) .cse34 v_DerPreprocessor_82))) (let ((.cse28 (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse33 (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse36 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_83) .cse33 v_DerPreprocessor_84) .cse34 v_DerPreprocessor_85))) (let ((.cse30 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse26 (select .cse37 (_ bv0 32))) (.cse31 (select |c_#memory_$Pointer$.offset| .cse33)) (.cse32 (select .cse36 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse26 (select .cse27 (_ bv0 32))) (= (store .cse28 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (= .cse29 .cse26) (not (= v_arrayElimCell_14 .cse26)) (= (_ bv0 32) (select .cse30 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse26)) (= (select .cse30 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse31 (_ bv4 32))) (= (store .cse32 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse2) (= .cse33 v_DerPreprocessor_79) (= .cse33 .cse26) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (_ bv0 32) (select .cse31 (_ bv0 32))) (= .cse34 .cse29) (= v_DerPreprocessor_81 (select .cse35 .cse33)) (= (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)) (= v_DerPreprocessor_84 (select .cse36 .cse33))))))))))))) (= (_ bv0 32) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse38 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse45 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse39 (select .cse45 (_ bv0 32))) (.cse43 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse42 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse41 (select .cse45 (_ bv4 32))) (.cse40 (select .cse43 (_ bv4 32))) (.cse44 (select |c_#memory_$Pointer$.offset| .cse39))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse39 .cse40) (= v_arrayElimIndex_18 .cse41) (= (_ bv0 32) (select .cse42 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse39)) (= (select .cse42 (_ bv4 32)) (_ bv0 32)) (= .cse39 (select .cse43 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse41 .cse40) (= (_ bv0 32) (select .cse44 (_ bv0 32))) (= (select .cse44 (_ bv4 32)) (_ bv0 32)) (not (= .cse39 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse49 (select .cse48 (_ bv4 32)))) (let ((.cse54 (select |c_#memory_$Pointer$.base| .cse49))) (let ((.cse51 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse54 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse46 (select .cse51 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse52 (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse50 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse47 (select .cse54 (_ bv0 32))) (.cse53 (select |c_#memory_$Pointer$.offset| .cse52))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse46 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (= .cse47 (select .cse48 (_ bv0 32))) (= .cse49 .cse47) (not (= v_arrayElimCell_14 .cse47)) (= (_ bv0 32) (select .cse50 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse51 .cse52)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse47)) (= v_DerPreprocessor_4 .cse52) (= .cse52 .cse47) (= (select .cse50 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse53 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse47) (_ bv4 32)) .cse49) (= (_ bv0 32) (select .cse53 (_ bv4 32)))))))))))) .cse38))))) is different from false [2024-11-25 02:20:02,929 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse14 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse38 (= (_ bv0 32) (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_79 (_ BitVec 32)) (v_DerPreprocessor_81 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_80 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_83 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_82 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse4 (select .cse1 (_ bv4 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse10 (select .cse13 (_ bv4 32)))) (let ((.cse11 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_80) v_DerPreprocessor_79 v_DerPreprocessor_81) .cse10 v_DerPreprocessor_82))) (let ((.cse2 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_83) .cse9 v_DerPreprocessor_84) .cse10 v_DerPreprocessor_85))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse0 (select .cse13 (_ bv0 32))) (.cse6 (select |c_#memory_$Pointer$.offset| .cse9)) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse0 (select .cse1 (_ bv0 32))) (= (store .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse3) (= .cse4 .cse0) (not (= v_arrayElimCell_14 .cse0)) (= (_ bv0 32) (select .cse5 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (= (select .cse5 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse6 (_ bv4 32))) (= (store .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse8) (= .cse9 v_DerPreprocessor_79) (= .cse9 .cse0) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (= .cse10 .cse4) (= v_DerPreprocessor_81 (select .cse11 .cse9)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)) (= v_DerPreprocessor_84 (select .cse12 .cse9)))))))))))))) (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (not (exists ((v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_38 (_ BitVec 32)) (v_DerPreprocessor_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_33 (_ BitVec 32)) (v_arrayElimIndex_40 (_ BitVec 32)) (v_DerPreprocessor_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_40))) (let ((.cse25 (select .cse24 (_ bv4 32)))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_34) v_DerPreprocessor_33 v_DerPreprocessor_35) .cse25 v_DerPreprocessor_36))) (let ((.cse18 (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse20 (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_41) .cse20 v_DerPreprocessor_42) .cse25 v_DerPreprocessor_43))) (let ((.cse17 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_38)) (.cse15 (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse21 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_38)) (.cse16 (select .cse24 (_ bv0 32))) (.cse22 (select |c_#memory_$Pointer$.offset| .cse20))) (and (= (store .cse15 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse8) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= .cse16 (select .cse17 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_38)) (= (store .cse18 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse3) (= v_DerPreprocessor_42 (select .cse19 .cse20)) (= (select .cse17 (_ bv4 32)) .cse16) (= (_ bv0 32) (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (_ bv0 32) (select .cse21 (_ bv4 32))) (= (_ bv0 32) (select .cse21 (_ bv0 32))) (= v_arrayElimIndex_40 .cse16) (not (= v_arrayElimIndex_38 .cse16)) (= (_ bv0 32) (select .cse22 (_ bv0 32))) (= .cse20 .cse16) (= v_DerPreprocessor_35 (select .cse23 .cse20)) (= .cse20 v_DerPreprocessor_33) (not (= (_ bv0 32) v_arrayElimIndex_38)) (= .cse16 (select (select |c_#memory_$Pointer$.base| .cse16) (_ bv4 32))) (= (_ bv0 32) (select .cse22 (_ bv4 32))))))))))))) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse30 (select .cse29 (_ bv4 32)))) (let ((.cse37 (select |c_#memory_$Pointer$.base| .cse30))) (let ((.cse36 (select .cse37 (_ bv4 32)))) (let ((.cse26 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse36 v_DerPreprocessor_23))) (let ((.cse35 (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse27 (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse27 v_DerPreprocessor_27) .cse36 v_DerPreprocessor_28))) (let ((.cse28 (select .cse37 (_ bv0 32))) (.cse32 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse33 (select |c_#memory_$Pointer$.offset| .cse27)) (.cse31 (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse26 .cse27) v_DerPreprocessor_22) (= .cse28 (select .cse29 (_ bv0 32))) (= .cse30 .cse28) (= .cse27 .cse28) (= (_ bv0 32) (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse28)) (= (_ bv0 32) (select .cse32 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse28)) (= .cse27 v_DerPreprocessor_20) (= (select .cse32 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse33 (_ bv4 32))) (= (select .cse34 .cse27) v_DerPreprocessor_27) (= (select .cse33 (_ bv0 32)) (_ bv0 32)) (= (store .cse35 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse3) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse36 .cse30) (= (store .cse31 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse8)))))))))))) (= (_ bv0 32) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse38 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse45 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse39 (select .cse45 (_ bv0 32))) (.cse43 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse42 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse41 (select .cse45 (_ bv4 32))) (.cse40 (select .cse43 (_ bv4 32))) (.cse44 (select |c_#memory_$Pointer$.offset| .cse39))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse39 .cse40) (= v_arrayElimIndex_18 .cse41) (= (_ bv0 32) (select .cse42 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse39)) (= (select .cse42 (_ bv4 32)) (_ bv0 32)) (= .cse39 (select .cse43 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse41 .cse40) (= (_ bv0 32) (select .cse44 (_ bv0 32))) (= (select .cse44 (_ bv4 32)) (_ bv0 32)) (not (= .cse39 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse49 (select .cse48 (_ bv4 32)))) (let ((.cse54 (select |c_#memory_$Pointer$.base| .cse49))) (let ((.cse51 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse54 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse46 (select .cse51 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse52 (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse50 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse47 (select .cse54 (_ bv0 32))) (.cse53 (select |c_#memory_$Pointer$.offset| .cse52))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse46 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse3) (= .cse47 (select .cse48 (_ bv0 32))) (= .cse49 .cse47) (not (= v_arrayElimCell_14 .cse47)) (= (_ bv0 32) (select .cse50 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse51 .cse52)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse47)) (= v_DerPreprocessor_4 .cse52) (= .cse52 .cse47) (= (select .cse50 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse53 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse47) (_ bv4 32)) .cse49) (= (_ bv0 32) (select .cse53 (_ bv4 32)))))))))))) .cse38))))) is different from false [2024-11-25 02:20:03,080 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse38 (= (_ bv0 32) (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (not (exists ((v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_38 (_ BitVec 32)) (v_DerPreprocessor_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_33 (_ BitVec 32)) (v_arrayElimIndex_40 (_ BitVec 32)) (v_DerPreprocessor_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_40))) (let ((.cse13 (select .cse12 (_ bv4 32)))) (let ((.cse11 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_34) v_DerPreprocessor_33 v_DerPreprocessor_35) .cse13 v_DerPreprocessor_36))) (let ((.cse5 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_41) .cse8 v_DerPreprocessor_42) .cse13 v_DerPreprocessor_43))) (let ((.cse4 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_38)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse9 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_38)) (.cse3 (select .cse12 (_ bv0 32))) (.cse10 (select |c_#memory_$Pointer$.offset| .cse8))) (and (= (store .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse2) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse3)) (= .cse3 (select .cse4 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_38)) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (= v_DerPreprocessor_42 (select .cse7 .cse8)) (= (select .cse4 (_ bv4 32)) .cse3) (= (_ bv0 32) (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (_ bv0 32) (select .cse9 (_ bv4 32))) (= (_ bv0 32) (select .cse9 (_ bv0 32))) (= v_arrayElimIndex_40 .cse3) (not (= v_arrayElimIndex_38 .cse3)) (= (_ bv0 32) (select .cse10 (_ bv0 32))) (= .cse8 .cse3) (= v_DerPreprocessor_35 (select .cse11 .cse8)) (= .cse8 v_DerPreprocessor_33) (not (= (_ bv0 32) v_arrayElimIndex_38)) (= .cse3 (select (select |c_#memory_$Pointer$.base| .cse3) (_ bv4 32))) (= (_ bv0 32) (select .cse10 (_ bv4 32))))))))))))) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse18 (select .cse17 (_ bv4 32)))) (let ((.cse25 (select |c_#memory_$Pointer$.base| .cse18))) (let ((.cse24 (select .cse25 (_ bv4 32)))) (let ((.cse14 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse24 v_DerPreprocessor_23))) (let ((.cse23 (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse15 (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse15 v_DerPreprocessor_27) .cse24 v_DerPreprocessor_28))) (let ((.cse16 (select .cse25 (_ bv0 32))) (.cse20 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse21 (select |c_#memory_$Pointer$.offset| .cse15)) (.cse19 (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse14 .cse15) v_DerPreprocessor_22) (= .cse16 (select .cse17 (_ bv0 32))) (= .cse18 .cse16) (= .cse15 .cse16) (= (_ bv0 32) (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse16)) (= (_ bv0 32) (select .cse20 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= .cse15 v_DerPreprocessor_20) (= (select .cse20 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse21 (_ bv4 32))) (= (select .cse22 .cse15) v_DerPreprocessor_27) (= (select .cse21 (_ bv0 32)) (_ bv0 32)) (= (store .cse23 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse24 .cse18) (= (store .cse19 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse2)))))))))))) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_79 (_ BitVec 32)) (v_DerPreprocessor_81 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_80 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_83 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_82 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse29 (select .cse27 (_ bv4 32)))) (let ((.cse37 (select |c_#memory_$Pointer$.base| .cse29))) (let ((.cse34 (select .cse37 (_ bv4 32)))) (let ((.cse35 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_80) v_DerPreprocessor_79 v_DerPreprocessor_81) .cse34 v_DerPreprocessor_82))) (let ((.cse28 (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse33 (select .cse28 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse36 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_83) .cse33 v_DerPreprocessor_84) .cse34 v_DerPreprocessor_85))) (let ((.cse30 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse26 (select .cse37 (_ bv0 32))) (.cse31 (select |c_#memory_$Pointer$.offset| .cse33)) (.cse32 (select .cse36 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse26 (select .cse27 (_ bv0 32))) (= (store .cse28 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (= .cse29 .cse26) (not (= v_arrayElimCell_14 .cse26)) (= (_ bv0 32) (select .cse30 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse26)) (= (select .cse30 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse31 (_ bv4 32))) (= (store .cse32 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse2) (= .cse33 v_DerPreprocessor_79) (= .cse33 .cse26) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (_ bv0 32) (select .cse31 (_ bv0 32))) (= .cse34 .cse29) (= v_DerPreprocessor_81 (select .cse35 .cse33)) (= (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)) (= v_DerPreprocessor_84 (select .cse36 .cse33))))))))))))) (= (_ bv0 32) (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse38 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse0)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse45 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse39 (select .cse45 (_ bv0 32))) (.cse43 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse42 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse41 (select .cse45 (_ bv4 32))) (.cse40 (select .cse43 (_ bv4 32))) (.cse44 (select |c_#memory_$Pointer$.offset| .cse39))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse39 .cse40) (= v_arrayElimIndex_18 .cse41) (= (_ bv0 32) (select .cse42 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse39)) (= (select .cse42 (_ bv4 32)) (_ bv0 32)) (= .cse39 (select .cse43 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse41 .cse40) (= (_ bv0 32) (select .cse44 (_ bv0 32))) (= (select .cse44 (_ bv4 32)) (_ bv0 32)) (not (= .cse39 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse49 (select .cse48 (_ bv4 32)))) (let ((.cse54 (select |c_#memory_$Pointer$.base| .cse49))) (let ((.cse51 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse54 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse46 (select .cse51 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse52 (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse50 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse47 (select .cse54 (_ bv0 32))) (.cse53 (select |c_#memory_$Pointer$.offset| .cse52))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse46 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse6) (= .cse47 (select .cse48 (_ bv0 32))) (= .cse49 .cse47) (not (= v_arrayElimCell_14 .cse47)) (= (_ bv0 32) (select .cse50 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse51 .cse52)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse47)) (= v_DerPreprocessor_4 .cse52) (= .cse52 .cse47) (= (select .cse50 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse53 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse47) (_ bv4 32)) .cse49) (= (_ bv0 32) (select .cse53 (_ bv4 32)))))))))))) .cse38)))))) is different from true [2024-11-25 02:20:03,198 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse8 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse14 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse38 (= (_ bv0 32) (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_79 (_ BitVec 32)) (v_DerPreprocessor_81 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_80 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_83 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_82 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse4 (select .cse1 (_ bv4 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse10 (select .cse13 (_ bv4 32)))) (let ((.cse11 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_80) v_DerPreprocessor_79 v_DerPreprocessor_81) .cse10 v_DerPreprocessor_82))) (let ((.cse2 (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse9 (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_83) .cse9 v_DerPreprocessor_84) .cse10 v_DerPreprocessor_85))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse0 (select .cse13 (_ bv0 32))) (.cse6 (select |c_#memory_$Pointer$.offset| .cse9)) (.cse7 (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse0 (select .cse1 (_ bv0 32))) (= (store .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse3) (= .cse4 .cse0) (not (= v_arrayElimCell_14 .cse0)) (= (_ bv0 32) (select .cse5 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse0)) (= (select .cse5 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse6 (_ bv4 32))) (= (store .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse8) (= .cse9 v_DerPreprocessor_79) (= .cse9 .cse0) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (= .cse10 .cse4) (= v_DerPreprocessor_81 (select .cse11 .cse9)) (= (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)) (= v_DerPreprocessor_84 (select .cse12 .cse9)))))))))))))) (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (not (exists ((v_DerPreprocessor_34 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_36 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_38 (_ BitVec 32)) (v_DerPreprocessor_35 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_33 (_ BitVec 32)) (v_arrayElimIndex_40 (_ BitVec 32)) (v_DerPreprocessor_41 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_42 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse24 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_40))) (let ((.cse25 (select .cse24 (_ bv4 32)))) (let ((.cse23 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_34) v_DerPreprocessor_33 v_DerPreprocessor_35) .cse25 v_DerPreprocessor_36))) (let ((.cse18 (select .cse23 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse20 (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_41) .cse20 v_DerPreprocessor_42) .cse25 v_DerPreprocessor_43))) (let ((.cse17 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_38)) (.cse15 (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse21 (select |c_#memory_$Pointer$.offset| v_arrayElimIndex_38)) (.cse16 (select .cse24 (_ bv0 32))) (.cse22 (select |c_#memory_$Pointer$.offset| .cse20))) (and (= (store .cse15 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse8) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= .cse16 (select .cse17 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimIndex_38)) (= (store .cse18 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse3) (= v_DerPreprocessor_42 (select .cse19 .cse20)) (= (select .cse17 (_ bv4 32)) .cse16) (= (_ bv0 32) (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (_ bv0 32) (select .cse21 (_ bv4 32))) (= (_ bv0 32) (select .cse21 (_ bv0 32))) (= v_arrayElimIndex_40 .cse16) (not (= v_arrayElimIndex_38 .cse16)) (= (_ bv0 32) (select .cse22 (_ bv0 32))) (= .cse20 .cse16) (= v_DerPreprocessor_35 (select .cse23 .cse20)) (= .cse20 v_DerPreprocessor_33) (not (= (_ bv0 32) v_arrayElimIndex_38)) (= .cse16 (select (select |c_#memory_$Pointer$.base| .cse16) (_ bv4 32))) (= (_ bv0 32) (select .cse22 (_ bv4 32))))))))))))) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse29 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse30 (select .cse29 (_ bv4 32)))) (let ((.cse37 (select |c_#memory_$Pointer$.base| .cse30))) (let ((.cse36 (select .cse37 (_ bv4 32)))) (let ((.cse26 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse36 v_DerPreprocessor_23))) (let ((.cse35 (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse27 (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse27 v_DerPreprocessor_27) .cse36 v_DerPreprocessor_28))) (let ((.cse28 (select .cse37 (_ bv0 32))) (.cse32 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse33 (select |c_#memory_$Pointer$.offset| .cse27)) (.cse31 (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse26 .cse27) v_DerPreprocessor_22) (= .cse28 (select .cse29 (_ bv0 32))) (= .cse30 .cse28) (= .cse27 .cse28) (= (_ bv0 32) (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse28)) (= (_ bv0 32) (select .cse32 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse28)) (= .cse27 v_DerPreprocessor_20) (= (select .cse32 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse33 (_ bv4 32))) (= (select .cse34 .cse27) v_DerPreprocessor_27) (= (select .cse33 (_ bv0 32)) (_ bv0 32)) (= (store .cse35 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse3) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse36 .cse30) (= (store .cse31 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse8)))))))))))) (= (_ bv0 32) (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse38 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse45 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse39 (select .cse45 (_ bv0 32))) (.cse43 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse42 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse41 (select .cse45 (_ bv4 32))) (.cse40 (select .cse43 (_ bv4 32))) (.cse44 (select |c_#memory_$Pointer$.offset| .cse39))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse39 .cse40) (= v_arrayElimIndex_18 .cse41) (= (_ bv0 32) (select .cse42 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse39)) (= (select .cse42 (_ bv4 32)) (_ bv0 32)) (= .cse39 (select .cse43 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse41 .cse40) (= (_ bv0 32) (select .cse44 (_ bv0 32))) (= (select .cse44 (_ bv4 32)) (_ bv0 32)) (not (= .cse39 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse48 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse49 (select .cse48 (_ bv4 32)))) (let ((.cse54 (select |c_#memory_$Pointer$.base| .cse49))) (let ((.cse51 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse54 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse46 (select .cse51 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse52 (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse50 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse47 (select .cse54 (_ bv0 32))) (.cse53 (select |c_#memory_$Pointer$.offset| .cse52))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse46 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse3) (= .cse47 (select .cse48 (_ bv0 32))) (= .cse49 .cse47) (not (= v_arrayElimCell_14 .cse47)) (= (_ bv0 32) (select .cse50 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse51 .cse52)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse47)) (= v_DerPreprocessor_4 .cse52) (= .cse52 .cse47) (= (select .cse50 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse53 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse47) (_ bv4 32)) .cse49) (= (_ bv0 32) (select .cse53 (_ bv4 32)))))))))))) .cse38)))))) is different from true [2024-11-25 02:20:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:20:03,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 33 states and 134 transitions. [2024-11-25 02:20:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 134 transitions. [2024-11-25 02:20:03,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:20:03,239 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:20:03,239 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:20:03,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:20:03,242 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:20:03,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-25 02:20:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:20:04,031 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:20:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:20:04,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-25 02:20:04,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:20:04,133 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-25 02:20:04,235 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-25 02:20:04,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-11-25 02:20:04,415 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-25 02:20:04,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-25 02:20:04,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:04,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:20:04,480 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 8 treesize of output 7 [2024-11-25 02:20:04,523 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:04,523 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2024-11-25 02:20:04,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:04,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:20:04,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-25 02:20:04,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 45 [2024-11-25 02:20:04,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 42 [2024-11-25 02:20:04,979 INFO L349 Elim1Store]: treesize reduction 237, result has 8.5 percent of original size [2024-11-25 02:20:04,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 495 treesize of output 194 [2024-11-25 02:20:04,994 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 24 treesize of output 1 [2024-11-25 02:20:05,003 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:05,003 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2024-11-25 02:20:05,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:05,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 60 [2024-11-25 02:20:05,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-25 02:20:05,903 INFO L349 Elim1Store]: treesize reduction 375, result has 5.1 percent of original size [2024-11-25 02:20:05,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 13 new quantified variables, introduced 25 case distinctions, treesize of input 363 treesize of output 323 [2024-11-25 02:20:05,927 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:05,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 242 [2024-11-25 02:20:06,041 INFO L349 Elim1Store]: treesize reduction 69, result has 6.8 percent of original size [2024-11-25 02:20:06,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 292 treesize of output 301 [2024-11-25 02:20:06,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 138 [2024-11-25 02:20:06,143 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-25 02:20:06,149 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:06,150 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 407 [2024-11-25 02:20:06,161 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:06,161 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2024-11-25 02:20:06,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:06,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:06,196 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:06,196 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:06,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 14 [2024-11-25 02:20:06,212 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:06,213 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2024-11-25 02:20:06,221 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:06,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-11-25 02:20:06,854 INFO L349 Elim1Store]: treesize reduction 157, result has 20.3 percent of original size [2024-11-25 02:20:06,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 4006 treesize of output 2813 [2024-11-25 02:20:07,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:07,019 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:07,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:07,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:07,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 7 disjoint index pairs (out of 36 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 162 treesize of output 174 [2024-11-25 02:20:08,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 6 [2024-11-25 02:20:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:20:08,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (14)] Ended with exit code 0 [2024-11-25 02:20:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:20:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 33 states and 134 transitions. [2024-11-25 02:20:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 134 transitions. [2024-11-25 02:20:08,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:20:08,662 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:20:08,663 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:20:08,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:20:08,666 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:20:08,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-25 02:20:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:20:09,482 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:20:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:20:09,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-25 02:20:09,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:20:09,581 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-25 02:20:09,669 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-25 02:20:09,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-11-25 02:20:09,874 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-25 02:20:09,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-25 02:20:09,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:09,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:20:09,949 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 8 treesize of output 7 [2024-11-25 02:20:09,958 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:09,958 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2024-11-25 02:20:09,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:09,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:20:09,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-25 02:20:10,043 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-25 02:20:10,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 67 [2024-11-25 02:20:10,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 41 [2024-11-25 02:20:10,583 INFO L349 Elim1Store]: treesize reduction 237, result has 8.5 percent of original size [2024-11-25 02:20:10,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 495 treesize of output 194 [2024-11-25 02:20:10,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:10,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 60 [2024-11-25 02:20:10,628 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:10,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 37 [2024-11-25 02:20:10,651 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 16 treesize of output 1 [2024-11-25 02:20:10,663 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 15 [2024-11-25 02:20:10,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-25 02:20:11,373 INFO L349 Elim1Store]: treesize reduction 375, result has 5.1 percent of original size [2024-11-25 02:20:11,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 13 new quantified variables, introduced 25 case distinctions, treesize of input 363 treesize of output 323 [2024-11-25 02:20:11,403 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:11,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 218 [2024-11-25 02:20:11,584 INFO L349 Elim1Store]: treesize reduction 69, result has 6.8 percent of original size [2024-11-25 02:20:11,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 264 treesize of output 269 [2024-11-25 02:20:11,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 126 [2024-11-25 02:20:11,681 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-25 02:20:11,690 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:11,691 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2024-11-25 02:20:11,701 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:11,709 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:11,710 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 276 [2024-11-25 02:20:11,726 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:11,726 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2024-11-25 02:20:11,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:11,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:11,768 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:11,769 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:11,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 14 [2024-11-25 02:20:11,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-11-25 02:20:12,905 INFO L349 Elim1Store]: treesize reduction 106, result has 25.9 percent of original size [2024-11-25 02:20:12,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 3392 treesize of output 3084 [2024-11-25 02:20:13,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:13,036 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:13,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:13,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:13,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 7 disjoint index pairs (out of 36 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 170 treesize of output 182 [2024-11-25 02:20:14,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 32 [2024-11-25 02:20:14,446 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 22 treesize of output 16 [2024-11-25 02:20:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:20:14,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-11-25 02:20:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:20:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 33 states and 134 transitions. [2024-11-25 02:20:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 134 transitions. [2024-11-25 02:20:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:20:28,513 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:20:28,513 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:20:28,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:20:28,517 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:20:28,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-25 02:20:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:20:29,367 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:20:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:20:29,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-25 02:20:29,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:20:29,484 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-25 02:20:29,740 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-25 02:20:29,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-11-25 02:20:30,189 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-25 02:20:30,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-25 02:20:30,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-25 02:20:30,295 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:30,295 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2024-11-25 02:20:30,310 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 8 treesize of output 1 [2024-11-25 02:20:30,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:30,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:20:30,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-25 02:20:30,454 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:30,454 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2024-11-25 02:20:30,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:30,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2024-11-25 02:20:30,805 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-25 02:20:30,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 51 [2024-11-25 02:20:30,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-11-25 02:20:30,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 [2024-11-25 02:20:30,886 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 16 treesize of output 15 [2024-11-25 02:20:31,816 INFO L349 Elim1Store]: treesize reduction 237, result has 8.5 percent of original size [2024-11-25 02:20:31,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 495 treesize of output 194 [2024-11-25 02:20:31,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:31,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 60 [2024-11-25 02:20:31,879 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 16 treesize of output 1 [2024-11-25 02:20:31,898 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:31,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 37 [2024-11-25 02:20:31,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-25 02:20:31,946 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 15 [2024-11-25 02:20:33,053 INFO L349 Elim1Store]: treesize reduction 375, result has 5.1 percent of original size [2024-11-25 02:20:33,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 13 new quantified variables, introduced 25 case distinctions, treesize of input 363 treesize of output 323 [2024-11-25 02:20:33,083 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:33,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 242 [2024-11-25 02:20:33,231 INFO L349 Elim1Store]: treesize reduction 69, result has 6.8 percent of original size [2024-11-25 02:20:33,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 292 treesize of output 301 [2024-11-25 02:20:33,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 138 [2024-11-25 02:20:33,333 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-25 02:20:33,343 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:33,343 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 407 [2024-11-25 02:20:33,357 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:33,358 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2024-11-25 02:20:33,371 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:33,384 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:33,385 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 201 [2024-11-25 02:20:33,399 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:33,399 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2024-11-25 02:20:33,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:36,776 INFO L349 Elim1Store]: treesize reduction 106, result has 25.9 percent of original size [2024-11-25 02:20:36,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 5505 treesize of output 4248 [2024-11-25 02:20:36,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:36,952 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:36,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:36,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:20:37,078 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:20:37,079 INFO L224 Elim1Store]: Index analysis took 111 ms [2024-11-25 02:20:37,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:20:37,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 502 treesize of output 482 [2024-11-25 02:20:37,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 215 [2024-11-25 02:20:37,680 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 0 case distinctions, treesize of input 106 treesize of output 103 [2024-11-25 02:20:37,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-25 02:20:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:20:39,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2024-11-25 02:21:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:21:04,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 32 states and 114 transitions. [2024-11-25 02:21:04,644 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 114 transitions. [2024-11-25 02:21:04,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:21:04,645 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:21:04,645 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:21:04,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:21:04,648 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:21:04,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-25 02:21:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:21:05,571 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:21:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:21:05,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-25 02:21:05,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:21:05,760 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-25 02:21:06,189 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-25 02:21:06,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-11-25 02:21:06,884 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-25 02:21:06,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-25 02:21:06,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-25 02:21:06,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-11-25 02:21:07,026 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 8 treesize of output 7 [2024-11-25 02:21:07,060 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:21:07,060 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2024-11-25 02:21:07,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:21:07,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:21:07,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-25 02:21:07,415 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-25 02:21:07,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 67 [2024-11-25 02:21:07,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 45 [2024-11-25 02:21:08,389 INFO L349 Elim1Store]: treesize reduction 237, result has 8.5 percent of original size [2024-11-25 02:21:08,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 495 treesize of output 194 [2024-11-25 02:21:08,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:21:08,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 60 [2024-11-25 02:21:08,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:21:08,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 55 [2024-11-25 02:21:08,525 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 16 treesize of output 1 [2024-11-25 02:21:08,550 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 15 [2024-11-25 02:21:08,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-25 02:21:10,277 INFO L349 Elim1Store]: treesize reduction 375, result has 5.1 percent of original size [2024-11-25 02:21:10,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 13 new quantified variables, introduced 25 case distinctions, treesize of input 363 treesize of output 323 [2024-11-25 02:21:10,317 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:21:10,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 218 [2024-11-25 02:21:10,500 INFO L349 Elim1Store]: treesize reduction 69, result has 6.8 percent of original size [2024-11-25 02:21:10,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 264 treesize of output 269 [2024-11-25 02:21:10,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 126 [2024-11-25 02:21:10,640 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-25 02:21:10,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:21:10,711 INFO L349 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2024-11-25 02:21:10,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 113 [2024-11-25 02:21:10,727 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:21:10,727 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 90 [2024-11-25 02:21:10,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 167 treesize of output 142 [2024-11-25 02:21:10,787 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:21:10,787 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2024-11-25 02:21:10,803 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:21:10,803 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2024-11-25 02:21:10,818 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:21:10,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:21:33,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:21:33,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:21:33,664 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:21:33,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 40 [2024-11-25 02:21:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-25 02:21:33,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-25 02:21:33,961 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse14 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse33 (= (_ bv0 32) (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse4 (select .cse3 (_ bv4 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse11 (select .cse13 (_ bv4 32)))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse11 v_DerPreprocessor_23))) (let ((.cse9 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse1 v_DerPreprocessor_27) .cse11 v_DerPreprocessor_28))) (let ((.cse2 (select .cse13 (_ bv0 32))) (.cse6 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse0 .cse1) v_DerPreprocessor_22) (= .cse2 (select .cse3 (_ bv0 32))) (= .cse4 .cse2) (= .cse1 .cse2) (= (_ bv0 32) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse2)) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2)) (= .cse1 v_DerPreprocessor_20) (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse7 (_ bv4 32))) (= (select .cse8 .cse1) v_DerPreprocessor_27) (= (select .cse7 (_ bv0 32)) (_ bv0 32)) (= (store .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse11 .cse4) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12))))))))))))) (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_123 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_143 (_ BitVec 32)) (v_DerPreprocessor_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_143))) (let ((.cse16 (select .cse23 (_ bv0 32))) (.cse21 (select .cse23 (_ bv4 32)))) (let ((.cse22 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14)) (.cse15 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_123) .cse16 v_DerPreprocessor_124) .cse21 v_DerPreprocessor_125))) (let ((.cse17 (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse18 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse20 (select .cse22 (_ bv4 32))) (.cse19 (select |c_#memory_$Pointer$.offset| .cse16))) (and (= v_DerPreprocessor_124 (select .cse15 .cse16)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (not (= v_arrayElimCell_14 .cse16)) (= (store .cse17 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= (_ bv0 32) (select .cse18 (_ bv0 32))) (= (_ bv0 32) (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select .cse18 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse19 (_ bv4 32))) (= .cse16 .cse20) (= v_arrayElimIndex_143 .cse21) (= .cse20 .cse21) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (_ bv0 32) (select .cse19 (_ bv0 32))) (= .cse16 (select .cse22 (_ bv0 32))))))))) (exists ((v_DerPreprocessor_67 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_265 (_ BitVec 32))) (let ((.cse32 (select |c_#memory_$Pointer$.base| v_arrayElimCell_265))) (let ((.cse26 (select .cse32 (_ bv4 32)))) (let ((.cse30 (select |c_#memory_$Pointer$.base| .cse26))) (let ((.cse28 (select .cse32 (_ bv0 32))) (.cse25 (select .cse30 (_ bv4 32)))) (let ((.cse31 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_65) .cse28 v_DerPreprocessor_66) .cse25 v_DerPreprocessor_67))) (let ((.cse24 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_265)) (.cse29 (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse27 (select |c_#memory_$Pointer$.offset| .cse28))) (and (= (_ bv0 32) (select .cse24 (_ bv0 32))) (= .cse25 .cse26) (= (_ bv0 32) (select .cse27 (_ bv0 32))) (not (= v_arrayElimCell_265 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_265 .cse28)) (= (store .cse29 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12) (= .cse28 (select .cse30 (_ bv0 32))) (= (_ bv0 32) (select .cse24 (_ bv4 32))) (= (_ bv0 32) (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse28 .cse26) (= (_ bv0 32) (select .cse27 (_ bv4 32))) (= v_DerPreprocessor_66 (select .cse31 .cse28)) (not (= v_arrayElimCell_265 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse28)))))))))) (= (_ bv0 32) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse33 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse40 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse34 (select .cse40 (_ bv0 32))) (.cse38 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse37 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse36 (select .cse40 (_ bv4 32))) (.cse35 (select .cse38 (_ bv4 32))) (.cse39 (select |c_#memory_$Pointer$.offset| .cse34))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse34 .cse35) (= v_arrayElimIndex_18 .cse36) (= (_ bv0 32) (select .cse37 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse34)) (= (select .cse37 (_ bv4 32)) (_ bv0 32)) (= .cse34 (select .cse38 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse36 .cse35) (= (_ bv0 32) (select .cse39 (_ bv0 32))) (= (select .cse39 (_ bv4 32)) (_ bv0 32)) (not (= .cse34 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse44 (select .cse43 (_ bv4 32)))) (let ((.cse49 (select |c_#memory_$Pointer$.base| .cse44))) (let ((.cse46 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse49 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse41 (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse47 (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse45 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse42 (select .cse49 (_ bv0 32))) (.cse48 (select |c_#memory_$Pointer$.offset| .cse47))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse41 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (= .cse42 (select .cse43 (_ bv0 32))) (= .cse44 .cse42) (not (= v_arrayElimCell_14 .cse42)) (= (_ bv0 32) (select .cse45 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse46 .cse47)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse42)) (= v_DerPreprocessor_4 .cse47) (= .cse47 .cse42) (= (select .cse45 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse48 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse42) (_ bv4 32)) .cse44) (= (_ bv0 32) (select .cse48 (_ bv4 32)))))))))))) .cse33))))) is different from false [2024-11-25 02:22:16,790 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse23 (= (_ bv0 32) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse24 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse34 (= (_ bv0 32) (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse4 (select .cse3 (_ bv4 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse11 (select .cse13 (_ bv4 32)))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse11 v_DerPreprocessor_23))) (let ((.cse9 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse1 v_DerPreprocessor_27) .cse11 v_DerPreprocessor_28))) (let ((.cse2 (select .cse13 (_ bv0 32))) (.cse6 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse0 .cse1) v_DerPreprocessor_22) (= .cse2 (select .cse3 (_ bv0 32))) (= .cse4 .cse2) (= .cse1 .cse2) (= (_ bv0 32) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse2)) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2)) (= .cse1 v_DerPreprocessor_20) (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse7 (_ bv4 32))) (= (select .cse8 .cse1) v_DerPreprocessor_27) (= (select .cse7 (_ bv0 32)) (_ bv0 32)) (= (store .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse11 .cse4) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12))))))))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_123 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_143 (_ BitVec 32)) (v_DerPreprocessor_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_143))) (let ((.cse15 (select .cse22 (_ bv0 32))) (.cse20 (select .cse22 (_ bv4 32)))) (let ((.cse21 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14)) (.cse14 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_123) .cse15 v_DerPreprocessor_124) .cse20 v_DerPreprocessor_125))) (let ((.cse16 (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse17 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse19 (select .cse21 (_ bv4 32))) (.cse18 (select |c_#memory_$Pointer$.offset| .cse15))) (and (= v_DerPreprocessor_124 (select .cse14 .cse15)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (not (= v_arrayElimCell_14 .cse15)) (= (store .cse16 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse15)) (= (_ bv0 32) (select .cse17 (_ bv0 32))) (= (_ bv0 32) (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select .cse17 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse18 (_ bv4 32))) (= .cse15 .cse19) (= v_arrayElimIndex_143 .cse20) (= .cse19 .cse20) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (_ bv0 32) (select .cse18 (_ bv0 32))) (= .cse15 (select .cse21 (_ bv0 32))))))))) .cse23)) (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse24)) (exists ((v_DerPreprocessor_67 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_265 (_ BitVec 32))) (let ((.cse33 (select |c_#memory_$Pointer$.base| v_arrayElimCell_265))) (let ((.cse27 (select .cse33 (_ bv4 32)))) (let ((.cse31 (select |c_#memory_$Pointer$.base| .cse27))) (let ((.cse29 (select .cse33 (_ bv0 32))) (.cse26 (select .cse31 (_ bv4 32)))) (let ((.cse32 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_65) .cse29 v_DerPreprocessor_66) .cse26 v_DerPreprocessor_67))) (let ((.cse25 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_265)) (.cse30 (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse28 (select |c_#memory_$Pointer$.offset| .cse29))) (and (= (_ bv0 32) (select .cse25 (_ bv0 32))) (= .cse26 .cse27) (= (_ bv0 32) (select .cse28 (_ bv0 32))) (not (= v_arrayElimCell_265 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_265 .cse29)) (= (store .cse30 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12) (= .cse29 (select .cse31 (_ bv0 32))) (= (_ bv0 32) (select .cse25 (_ bv4 32))) (= (_ bv0 32) (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse29 .cse27) (= (_ bv0 32) (select .cse28 (_ bv4 32))) (= v_DerPreprocessor_66 (select .cse32 .cse29)) (not (= v_arrayElimCell_265 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse29)))))))))) .cse23 .cse34 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse24)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse41 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse35 (select .cse41 (_ bv0 32))) (.cse39 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse38 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse37 (select .cse41 (_ bv4 32))) (.cse36 (select .cse39 (_ bv4 32))) (.cse40 (select |c_#memory_$Pointer$.offset| .cse35))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse35 .cse36) (= v_arrayElimIndex_18 .cse37) (= (_ bv0 32) (select .cse38 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse35)) (= (select .cse38 (_ bv4 32)) (_ bv0 32)) (= .cse35 (select .cse39 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse37 .cse36) (= (_ bv0 32) (select .cse40 (_ bv0 32))) (= (select .cse40 (_ bv4 32)) (_ bv0 32)) (not (= .cse35 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse45 (select .cse44 (_ bv4 32)))) (let ((.cse50 (select |c_#memory_$Pointer$.base| .cse45))) (let ((.cse47 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse50 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse42 (select .cse47 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse48 (select .cse42 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse46 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse43 (select .cse50 (_ bv0 32))) (.cse49 (select |c_#memory_$Pointer$.offset| .cse48))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse42 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (= .cse43 (select .cse44 (_ bv0 32))) (= .cse45 .cse43) (not (= v_arrayElimCell_14 .cse43)) (= (_ bv0 32) (select .cse46 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse47 .cse48)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse43)) (= v_DerPreprocessor_4 .cse48) (= .cse48 .cse43) (= (select .cse46 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse49 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse43) (_ bv4 32)) .cse45) (= (_ bv0 32) (select .cse49 (_ bv4 32)))))))))))) .cse34))))) is different from false [2024-11-25 02:22:16,926 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse14 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse33 (= (_ bv0 32) (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse4 (select .cse3 (_ bv4 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse11 (select .cse13 (_ bv4 32)))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse11 v_DerPreprocessor_23))) (let ((.cse9 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse1 v_DerPreprocessor_27) .cse11 v_DerPreprocessor_28))) (let ((.cse2 (select .cse13 (_ bv0 32))) (.cse6 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse0 .cse1) v_DerPreprocessor_22) (= .cse2 (select .cse3 (_ bv0 32))) (= .cse4 .cse2) (= .cse1 .cse2) (= (_ bv0 32) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse2)) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2)) (= .cse1 v_DerPreprocessor_20) (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse7 (_ bv4 32))) (= (select .cse8 .cse1) v_DerPreprocessor_27) (= (select .cse7 (_ bv0 32)) (_ bv0 32)) (= (store .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse11 .cse4) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12))))))))))))) (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_123 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_143 (_ BitVec 32)) (v_DerPreprocessor_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_143))) (let ((.cse16 (select .cse23 (_ bv0 32))) (.cse21 (select .cse23 (_ bv4 32)))) (let ((.cse22 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14)) (.cse15 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_123) .cse16 v_DerPreprocessor_124) .cse21 v_DerPreprocessor_125))) (let ((.cse17 (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse18 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse20 (select .cse22 (_ bv4 32))) (.cse19 (select |c_#memory_$Pointer$.offset| .cse16))) (and (= v_DerPreprocessor_124 (select .cse15 .cse16)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (not (= v_arrayElimCell_14 .cse16)) (= (store .cse17 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse16)) (= (_ bv0 32) (select .cse18 (_ bv0 32))) (= (_ bv0 32) (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select .cse18 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse19 (_ bv4 32))) (= .cse16 .cse20) (= v_arrayElimIndex_143 .cse21) (= .cse20 .cse21) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (_ bv0 32) (select .cse19 (_ bv0 32))) (= .cse16 (select .cse22 (_ bv0 32))))))))) (exists ((v_DerPreprocessor_67 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_265 (_ BitVec 32))) (let ((.cse32 (select |c_#memory_$Pointer$.base| v_arrayElimCell_265))) (let ((.cse26 (select .cse32 (_ bv4 32)))) (let ((.cse30 (select |c_#memory_$Pointer$.base| .cse26))) (let ((.cse28 (select .cse32 (_ bv0 32))) (.cse25 (select .cse30 (_ bv4 32)))) (let ((.cse31 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_65) .cse28 v_DerPreprocessor_66) .cse25 v_DerPreprocessor_67))) (let ((.cse24 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_265)) (.cse29 (select .cse31 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse27 (select |c_#memory_$Pointer$.offset| .cse28))) (and (= (_ bv0 32) (select .cse24 (_ bv0 32))) (= .cse25 .cse26) (= (_ bv0 32) (select .cse27 (_ bv0 32))) (not (= v_arrayElimCell_265 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_265 .cse28)) (= (store .cse29 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12) (= .cse28 (select .cse30 (_ bv0 32))) (= (_ bv0 32) (select .cse24 (_ bv4 32))) (= (_ bv0 32) (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse28 .cse26) (= (_ bv0 32) (select .cse27 (_ bv4 32))) (= v_DerPreprocessor_66 (select .cse31 .cse28)) (not (= v_arrayElimCell_265 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse28)))))))))) (= (_ bv0 32) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse33 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse14)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse40 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse34 (select .cse40 (_ bv0 32))) (.cse38 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse37 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse36 (select .cse40 (_ bv4 32))) (.cse35 (select .cse38 (_ bv4 32))) (.cse39 (select |c_#memory_$Pointer$.offset| .cse34))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse34 .cse35) (= v_arrayElimIndex_18 .cse36) (= (_ bv0 32) (select .cse37 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse34)) (= (select .cse37 (_ bv4 32)) (_ bv0 32)) (= .cse34 (select .cse38 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse36 .cse35) (= (_ bv0 32) (select .cse39 (_ bv0 32))) (= (select .cse39 (_ bv4 32)) (_ bv0 32)) (not (= .cse34 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse43 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse44 (select .cse43 (_ bv4 32)))) (let ((.cse49 (select |c_#memory_$Pointer$.base| .cse44))) (let ((.cse46 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse49 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse41 (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse47 (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse45 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse42 (select .cse49 (_ bv0 32))) (.cse48 (select |c_#memory_$Pointer$.offset| .cse47))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse41 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (= .cse42 (select .cse43 (_ bv0 32))) (= .cse44 .cse42) (not (= v_arrayElimCell_14 .cse42)) (= (_ bv0 32) (select .cse45 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse46 .cse47)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse42)) (= v_DerPreprocessor_4 .cse47) (= .cse47 .cse42) (= (select .cse45 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse48 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse42) (_ bv4 32)) .cse44) (= (_ bv0 32) (select .cse48 (_ bv4 32)))))))))))) .cse33)))))) is different from true [2024-11-25 02:22:27,380 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse12 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse23 (= (_ bv0 32) (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse24 (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|)) (.cse34 (= (_ bv0 32) (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (and (not (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_20 (_ BitVec 32)) (v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse4 (select .cse3 (_ bv4 32)))) (let ((.cse13 (select |c_#memory_$Pointer$.base| .cse4))) (let ((.cse11 (select .cse13 (_ bv4 32)))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_21) v_DerPreprocessor_20 v_DerPreprocessor_22) .cse11 v_DerPreprocessor_23))) (let ((.cse9 (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_26) .cse1 v_DerPreprocessor_27) .cse11 v_DerPreprocessor_28))) (let ((.cse2 (select .cse13 (_ bv0 32))) (.cse6 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse7 (select |c_#memory_$Pointer$.offset| .cse1)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (select .cse0 .cse1) v_DerPreprocessor_22) (= .cse2 (select .cse3 (_ bv0 32))) (= .cse4 .cse2) (= .cse1 .cse2) (= (_ bv0 32) (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (not (= v_arrayElimCell_14 .cse2)) (= (_ bv0 32) (select .cse6 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse2)) (= .cse1 v_DerPreprocessor_20) (= (select .cse6 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse7 (_ bv4 32))) (= (select .cse8 .cse1) v_DerPreprocessor_27) (= (select .cse7 (_ bv0 32)) (_ bv0 32)) (= (store .cse9 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse11 .cse4) (= (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12))))))))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_124 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_123 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimIndex_143 (_ BitVec 32)) (v_DerPreprocessor_125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_143))) (let ((.cse15 (select .cse22 (_ bv0 32))) (.cse20 (select .cse22 (_ bv4 32)))) (let ((.cse21 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14)) (.cse14 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_123) .cse15 v_DerPreprocessor_124) .cse20 v_DerPreprocessor_125))) (let ((.cse16 (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse17 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse19 (select .cse21 (_ bv4 32))) (.cse18 (select |c_#memory_$Pointer$.offset| .cse15))) (and (= v_DerPreprocessor_124 (select .cse14 .cse15)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (not (= v_arrayElimCell_14 .cse15)) (= (store .cse16 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse15)) (= (_ bv0 32) (select .cse17 (_ bv0 32))) (= (_ bv0 32) (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= (select .cse17 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse18 (_ bv4 32))) (= .cse15 .cse19) (= v_arrayElimIndex_143 .cse20) (= .cse19 .cse20) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (_ bv0 32) (select .cse18 (_ bv0 32))) (= .cse15 (select .cse21 (_ bv0 32))))))))) .cse23)) (not (and (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) .cse24)) (exists ((v_DerPreprocessor_67 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_65 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_265 (_ BitVec 32))) (let ((.cse33 (select |c_#memory_$Pointer$.base| v_arrayElimCell_265))) (let ((.cse27 (select .cse33 (_ bv4 32)))) (let ((.cse31 (select |c_#memory_$Pointer$.base| .cse27))) (let ((.cse29 (select .cse33 (_ bv0 32))) (.cse26 (select .cse31 (_ bv4 32)))) (let ((.cse32 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_65) .cse29 v_DerPreprocessor_66) .cse26 v_DerPreprocessor_67))) (let ((.cse25 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_265)) (.cse30 (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse28 (select |c_#memory_$Pointer$.offset| .cse29))) (and (= (_ bv0 32) (select .cse25 (_ bv0 32))) (= .cse26 .cse27) (= (_ bv0 32) (select .cse28 (_ bv0 32))) (not (= v_arrayElimCell_265 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= v_arrayElimCell_265 .cse29)) (= (store .cse30 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse12) (= .cse29 (select .cse31 (_ bv0 32))) (= (_ bv0 32) (select .cse25 (_ bv4 32))) (= (_ bv0 32) (select .cse30 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (= .cse29 .cse27) (= (_ bv0 32) (select .cse28 (_ bv4 32))) (= v_DerPreprocessor_66 (select .cse32 .cse29)) (not (= v_arrayElimCell_265 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse29)))))))))) .cse23 .cse34 (not (and (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse24)) (exists ((v_arrayElimIndex_18 (_ BitVec 32)) (v_arrayElimCell_14 (_ BitVec 32))) (let ((.cse41 (select |c_#memory_$Pointer$.base| v_arrayElimIndex_18))) (let ((.cse35 (select .cse41 (_ bv0 32))) (.cse39 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse38 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse37 (select .cse41 (_ bv4 32))) (.cse36 (select .cse39 (_ bv4 32))) (.cse40 (select |c_#memory_$Pointer$.offset| .cse35))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= .cse35 .cse36) (= v_arrayElimIndex_18 .cse37) (= (_ bv0 32) (select .cse38 (_ bv0 32))) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse35)) (= (select .cse38 (_ bv4 32)) (_ bv0 32)) (= .cse35 (select .cse39 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= .cse37 .cse36) (= (_ bv0 32) (select .cse40 (_ bv0 32))) (= (select .cse40 (_ bv4 32)) (_ bv0 32)) (not (= .cse35 v_arrayElimCell_14))))))) (not (and (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse44 (select |c_#memory_$Pointer$.base| v_arrayElimCell_14))) (let ((.cse45 (select .cse44 (_ bv4 32)))) (let ((.cse50 (select |c_#memory_$Pointer$.base| .cse45))) (let ((.cse47 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base| v_DerPreprocessor_5) v_DerPreprocessor_4 v_DerPreprocessor_6) (select .cse50 (_ bv4 32)) v_DerPreprocessor_7))) (let ((.cse42 (select .cse47 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse48 (select .cse42 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse46 (select |c_#memory_$Pointer$.offset| v_arrayElimCell_14)) (.cse43 (select .cse50 (_ bv0 32))) (.cse49 (select |c_#memory_$Pointer$.offset| .cse48))) (and (not (= |c_ULTIMATE.start_main_~#s~0#1.base| v_arrayElimCell_14)) (= (store .cse42 |c_ULTIMATE.start_main_~#s~0#1.offset| (_ bv0 32)) .cse10) (= .cse43 (select .cse44 (_ bv0 32))) (= .cse45 .cse43) (not (= v_arrayElimCell_14 .cse43)) (= (_ bv0 32) (select .cse46 (_ bv0 32))) (= v_DerPreprocessor_6 (select .cse47 .cse48)) (not (= |c_ULTIMATE.start_main_~#s~0#1.base| .cse43)) (= v_DerPreprocessor_4 .cse48) (= .cse48 .cse43) (= (select .cse46 (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select .cse49 (_ bv0 32))) (not (= (_ bv0 32) v_arrayElimCell_14)) (= (select (select |c_#memory_$Pointer$.base| .cse43) (_ bv4 32)) .cse45) (= (_ bv0 32) (select .cse49 (_ bv4 32)))))))))))) .cse34)))))) is different from true [2024-11-25 02:22:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-25 02:22:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 33 states and 134 transitions. [2024-11-25 02:22:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 134 transitions. [2024-11-25 02:22:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-25 02:22:27,410 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-25 02:22:27,410 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-25 02:22:27,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 [2024-11-25 02:22:27,414 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-25 02:22:27,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-25 02:22:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:22:28,335 ERROR L568 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-25 02:22:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-25 02:22:28,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-25 02:22:28,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-25 02:22:28,496 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-25 02:22:29,050 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-25 02:22:29,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2024-11-25 02:22:29,992 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-25 02:22:29,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-25 02:22:30,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:22:30,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2024-11-25 02:22:30,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-25 02:22:30,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-25 02:22:30,187 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:22:30,188 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2024-11-25 02:22:30,224 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 8 treesize of output 1 [2024-11-25 02:22:30,422 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:22:30,422 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2024-11-25 02:22:30,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:22:30,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2024-11-25 02:22:31,115 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-25 02:22:31,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 51 [2024-11-25 02:22:31,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-11-25 02:22:31,201 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 12 treesize of output 11 [2024-11-25 02:22:31,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 15 [2024-11-25 02:22:32,897 INFO L349 Elim1Store]: treesize reduction 237, result has 8.5 percent of original size [2024-11-25 02:22:32,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 495 treesize of output 194 [2024-11-25 02:22:33,214 INFO L349 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2024-11-25 02:22:33,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 184 treesize of output 144 [2024-11-25 02:22:33,242 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 15 [2024-11-25 02:22:33,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:22:33,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2024-11-25 02:22:33,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-25 02:22:33,599 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 16 treesize of output 1 [2024-11-25 02:22:35,442 INFO L349 Elim1Store]: treesize reduction 373, result has 5.6 percent of original size [2024-11-25 02:22:35,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 13 new quantified variables, introduced 25 case distinctions, treesize of input 363 treesize of output 325 [2024-11-25 02:22:35,486 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:22:35,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 242 [2024-11-25 02:22:35,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 208 [2024-11-25 02:22:35,753 INFO L349 Elim1Store]: treesize reduction 69, result has 6.8 percent of original size [2024-11-25 02:22:35,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 291 [2024-11-25 02:22:35,887 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2024-11-25 02:22:35,906 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:22:35,907 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2024-11-25 02:22:35,927 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-25 02:22:35,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:22:36,017 INFO L349 Elim1Store]: treesize reduction 67, result has 1.5 percent of original size [2024-11-25 02:22:36,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 100 [2024-11-25 02:22:36,036 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:22:36,036 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 106 [2024-11-25 02:22:36,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 162 treesize of output 141 [2024-11-25 02:22:36,092 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-25 02:22:36,093 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2024-11-25 02:22:36,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-25 02:23:55,639 WARN L249 Executor]: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-25 02:23:55,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Forceful destruction successful, exit code 101 [2024-11-25 02:23:55,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e4aa89-33ad-419a-8caf-0accf044db23/bin/ukojak-verify-ENZ3QT5qd3/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2024-11-25 02:23:55,649 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck has thrown an exception: java.lang.AssertionError: No Interpolants at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.getInterpolants(InterpolatingTraceCheck.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:467) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:166) 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) [2024-11-25 02:23:55,654 INFO L158 Benchmark]: Toolchain (without parser) took 393419.78ms. Allocated memory was 83.9MB in the beginning and 654.3MB in the end (delta: 570.4MB). Free memory was 59.4MB in the beginning and 343.2MB in the end (delta: -283.8MB). Peak memory consumption was 286.9MB. Max. memory is 16.1GB. [2024-11-25 02:23:55,654 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:23:55,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.84ms. Allocated memory is still 83.9MB. Free memory was 59.1MB in the beginning and 40.4MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-25 02:23:55,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.42ms. Allocated memory is still 83.9MB. Free memory was 40.4MB in the beginning and 38.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-25 02:23:55,656 INFO L158 Benchmark]: Boogie Preprocessor took 55.58ms. Allocated memory is still 83.9MB. Free memory was 38.6MB in the beginning and 37.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-25 02:23:55,656 INFO L158 Benchmark]: RCFGBuilder took 691.85ms. Allocated memory is still 83.9MB. Free memory was 37.1MB in the beginning and 41.1MB in the end (delta: -4.0MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-25 02:23:55,660 INFO L158 Benchmark]: CodeCheck took 392103.54ms. Allocated memory was 83.9MB in the beginning and 654.3MB in the end (delta: 570.4MB). Free memory was 41.1MB in the beginning and 343.2MB in the end (delta: -302.1MB). Peak memory consumption was 266.2MB. Max. memory is 16.1GB. [2024-11-25 02:23:55,661 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: AssertionError: No Interpolants de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: AssertionError: No Interpolants: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.getInterpolants(InterpolatingTraceCheck.java:138) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 501.84ms. Allocated memory is still 83.9MB. Free memory was 59.1MB in the beginning and 40.4MB in the end (delta: 18.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.42ms. Allocated memory is still 83.9MB. Free memory was 40.4MB in the beginning and 38.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.58ms. Allocated memory is still 83.9MB. Free memory was 38.6MB in the beginning and 37.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 691.85ms. Allocated memory is still 83.9MB. Free memory was 37.1MB in the beginning and 41.1MB in the end (delta: -4.0MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * CodeCheck took 392103.54ms. Allocated memory was 83.9MB in the beginning and 654.3MB in the end (delta: 570.4MB). Free memory was 41.1MB in the beginning and 343.2MB in the end (delta: -302.1MB). Peak memory consumption was 266.2MB. Max. memory is 16.1GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: No Interpolants