./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/ncomp.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/array-fpi/ncomp.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm --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 c3d1ff002f6e6cf179cc6204a129c133a3beda704ea9fff27ad69a10f5c1f33d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:09:26,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:09:26,120 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Default.epf [2024-11-13 23:09:26,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 23:09:26,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2024-11-13 23:09:26,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:09:26,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:09:26,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 23:09:26,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 23:09:26,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 23:09:26,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:09:26,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:09:26,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:09:26,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 23:09:26,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:09:26,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:09:26,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:09:26,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:09:26,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:09:26,171 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:09:26,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:09:26,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:09:26,172 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:09:26,172 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 23:09:26,172 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 23:09:26,172 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 23:09:26,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:09:26,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 23:09:26,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:09:26,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:09:26,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:09:26,173 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2024-11-13 23:09:26,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 23:09:26,173 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_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm 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 -> c3d1ff002f6e6cf179cc6204a129c133a3beda704ea9fff27ad69a10f5c1f33d [2024-11-13 23:09:26,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:09:26,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:09:26,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:09:26,584 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:09:26,584 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:09:26,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/array-fpi/ncomp.c Unable to find full path for "g++" [2024-11-13 23:09:28,548 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:09:28,861 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:09:28,861 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/sv-benchmarks/c/array-fpi/ncomp.c [2024-11-13 23:09:28,868 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/data/a8a044dae/c1886e005ce74370a1aecb40a071ad16/FLAG882529026 [2024-11-13 23:09:28,883 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/data/a8a044dae/c1886e005ce74370a1aecb40a071ad16 [2024-11-13 23:09:28,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:09:28,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:09:28,889 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:09:28,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:09:28,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:09:28,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:09:28" (1/1) ... [2024-11-13 23:09:28,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f27962c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:09:28, skipping insertion in model container [2024-11-13 23:09:28,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:09:28" (1/1) ... [2024-11-13 23:09:28,913 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:09:29,085 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_f800add9-785d-432e-bb08-fccae69424bc/sv-benchmarks/c/array-fpi/ncomp.c[588,601] [2024-11-13 23:09:29,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:09:29,128 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:09:29,147 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_f800add9-785d-432e-bb08-fccae69424bc/sv-benchmarks/c/array-fpi/ncomp.c[588,601] [2024-11-13 23:09:29,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:09:29,193 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:09:29,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:09:29 WrapperNode [2024-11-13 23:09:29,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:09:29,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:09:29,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:09:29,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:09:29,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:09:29" (1/1) ... [2024-11-13 23:09:29,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:09:29" (1/1) ... [2024-11-13 23:09:29,257 INFO L138 Inliner]: procedures = 16, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2024-11-13 23:09:29,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:09:29,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:09:29,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:09:29,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:09:29,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:09:29" (1/1) ... [2024-11-13 23:09:29,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:09:29" (1/1) ... [2024-11-13 23:09:29,272 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:09:29" (1/1) ... [2024-11-13 23:09:29,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:09:29" (1/1) ... [2024-11-13 23:09:29,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:09:29" (1/1) ... [2024-11-13 23:09:29,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:09:29" (1/1) ... [2024-11-13 23:09:29,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:09:29" (1/1) ... [2024-11-13 23:09:29,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:09:29" (1/1) ... [2024-11-13 23:09:29,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:09:29,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:09:29,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:09:29,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:09:29,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:09:29" (1/1) ... [2024-11-13 23:09:29,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 23:09:29,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 23:09:29,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 23:09:29,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 23:09:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:09:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 23:09:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 23:09:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 23:09:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:09:29,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:09:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 23:09:29,464 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:09:29,466 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:09:29,805 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-13 23:09:29,805 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:09:29,883 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:09:29,883 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-13 23:09:29,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:09:29 BoogieIcfgContainer [2024-11-13 23:09:29,884 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:09:29,884 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 23:09:29,884 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 23:09:29,896 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 23:09:29,896 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:09:29" (1/1) ... [2024-11-13 23:09:29,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:09:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 12 states and 17 transitions. [2024-11-13 23:09:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2024-11-13 23:09:29,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 23:09:29,976 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:09:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:30,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 23:09:30,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:09:30,546 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 23:09:30,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2024-11-13 23:09:30,596 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-13 23:09:30,733 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-13 23:09:30,764 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-13 23:09:30,855 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-13 23:09:31,032 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:09:31,066 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-13 23:09:31,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 75 [2024-11-13 23:09:31,155 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:09:31,161 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:09:31,164 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:09:31,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 54 treesize of output 32 [2024-11-13 23:09:31,260 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:09:31,261 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2024-11-13 23:09:31,292 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:09:31,293 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2024-11-13 23:09:31,501 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:09:31,502 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2024-11-13 23:09:31,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:09:31,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-11-13 23:09:31,581 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-13 23:09:31,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2024-11-13 23:09:31,603 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-13 23:09:31,608 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-13 23:09:31,696 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-13 23:09:31,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 17 states and 33 transitions. [2024-11-13 23:09:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 33 transitions. [2024-11-13 23:09:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 23:09:31,829 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:31,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:09:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 20 states and 47 transitions. [2024-11-13 23:09:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 47 transitions. [2024-11-13 23:09:32,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 23:09:32,586 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:32,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:32,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:09:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:33,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 21 states and 51 transitions. [2024-11-13 23:09:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 51 transitions. [2024-11-13 23:09:33,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 23:09:33,059 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:33,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:33,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:09:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 22 states and 55 transitions. [2024-11-13 23:09:33,291 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 55 transitions. [2024-11-13 23:09:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 23:09:33,292 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:33,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:09:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 21 states and 49 transitions. [2024-11-13 23:09:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 49 transitions. [2024-11-13 23:09:33,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 23:09:33,597 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:33,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:33,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:09:33,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 23 states and 56 transitions. [2024-11-13 23:09:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 56 transitions. [2024-11-13 23:09:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 23:09:33,948 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:33,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:09:34,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 22 states and 49 transitions. [2024-11-13 23:09:34,243 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 49 transitions. [2024-11-13 23:09:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 23:09:34,243 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:34,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:09:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 23 states and 53 transitions. [2024-11-13 23:09:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 53 transitions. [2024-11-13 23:09:34,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 23:09:34,535 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:34,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:09:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:34,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 23:09:34,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:09:34,775 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 14 treesize of output 12 [2024-11-13 23:09:34,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:09:34,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:09:34,823 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 23:09:34,824 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 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 23:09:34,833 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-13 23:09:34,915 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 16 treesize of output 11 [2024-11-13 23:09:35,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:09:35,142 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2024-11-13 23:09:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:09:36,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 24 states and 56 transitions. [2024-11-13 23:09:36,072 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 56 transitions. [2024-11-13 23:09:36,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 23:09:36,072 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:36,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:09:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:36,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-13 23:09:36,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:09:36,312 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 14 treesize of output 12 [2024-11-13 23:09:36,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:09:36,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:09:36,350 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 23:09:36,350 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 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 23:09:36,355 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-13 23:09:36,440 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 16 treesize of output 11 [2024-11-13 23:09:36,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:09:36,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-13 23:09:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:09:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:38,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 28 states and 69 transitions. [2024-11-13 23:09:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 69 transitions. [2024-11-13 23:09:38,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 23:09:38,050 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:38,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:09:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 32 states and 77 transitions. [2024-11-13 23:09:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 77 transitions. [2024-11-13 23:09:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 23:09:38,891 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:09:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 36 states and 96 transitions. [2024-11-13 23:09:40,339 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 96 transitions. [2024-11-13 23:09:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 23:09:40,340 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:40,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:09:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 37 states and 99 transitions. [2024-11-13 23:09:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 99 transitions. [2024-11-13 23:09:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 23:09:40,802 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:40,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:09:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 42 states and 113 transitions. [2024-11-13 23:09:42,403 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 113 transitions. [2024-11-13 23:09:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 23:09:42,404 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:42,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:09:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 45 states and 129 transitions. [2024-11-13 23:09:43,745 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 129 transitions. [2024-11-13 23:09:43,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 23:09:43,745 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:43,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:09:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:44,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 46 states and 129 transitions. [2024-11-13 23:09:44,497 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 129 transitions. [2024-11-13 23:09:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 23:09:44,497 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:44,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:09:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 50 states and 140 transitions. [2024-11-13 23:09:45,743 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 140 transitions. [2024-11-13 23:09:45,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 23:09:45,744 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:45,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:45,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:09:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 51 states and 137 transitions. [2024-11-13 23:09:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 137 transitions. [2024-11-13 23:09:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:09:46,500 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:46,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:09:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:46,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 23:09:46,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:09:46,972 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 23:09:46,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2024-11-13 23:09:46,989 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-13 23:09:47,055 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-13 23:09:47,075 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-13 23:09:47,123 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-13 23:09:47,163 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:09:47,200 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2024-11-13 23:09:47,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 98 [2024-11-13 23:09:47,357 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:09:47,359 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 125 [2024-11-13 23:09:47,443 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:09:47,444 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2024-11-13 23:09:47,529 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:09:47,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 11 [2024-11-13 23:09:47,535 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-13 23:09:47,557 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:09:47,557 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2024-11-13 23:09:47,585 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:09:47,586 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 117 [2024-11-13 23:09:47,626 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 14 treesize of output 12 [2024-11-13 23:09:47,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:09:47,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:09:47,972 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-13 23:09:47,972 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 85 [2024-11-13 23:09:47,985 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 44 treesize of output 42 [2024-11-13 23:09:48,019 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 16 treesize of output 11 [2024-11-13 23:09:48,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:09:48,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:09:48,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-13 23:09:48,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:09:48,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 52 [2024-11-13 23:09:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:09:48,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse1 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse8 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) .cse1 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) .cse2 (not (and .cse0 (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse3 .cse4) (= v_DerPreprocessor_10 .cse4) (= .cse5 (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse5 (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse1 .cse2 .cse8)) .cse8)) is different from false [2024-11-13 23:09:49,211 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse0 (= c_~N~0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse1 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse2 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse8 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) .cse1 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) .cse2 (not (and .cse0 (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse3 .cse4) (= v_DerPreprocessor_10 .cse4) (= .cse5 (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse5 (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse1 .cse2 .cse8)) .cse8))) is different from true [2024-11-13 23:09:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:09:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 54 states and 147 transitions. [2024-11-13 23:09:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 147 transitions. [2024-11-13 23:09:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:09:50,841 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:09:50,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:09:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:09:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:09:50,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-13 23:09:50,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:09:50,979 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:09:50,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 23:09:50,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:09:50,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:09:50,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:09:51,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2024-11-13 23:09:51,008 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-13 23:09:51,017 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-13 23:09:51,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-13 23:09:51,444 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2024-11-13 23:09:51,952 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2024-11-13 23:09:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:10:13,254 WARN L286 SmtUtils]: Spent 20.12s on a formula simplification. DAG size of input: 58 DAG size of output: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:10:33,802 WARN L286 SmtUtils]: Spent 20.06s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:10:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:10:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 64 states and 177 transitions. [2024-11-13 23:10:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 177 transitions. [2024-11-13 23:10:50,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:10:50,479 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:10:50,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:10:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:10:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:10:50,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 23:10:50,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:10:50,923 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 23:10:50,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2024-11-13 23:10:50,947 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-13 23:10:51,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:10:51,009 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 8 treesize of output 1 [2024-11-13 23:10:51,023 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-13 23:10:51,076 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-13 23:10:51,125 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:10:51,126 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2024-11-13 23:10:51,222 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:10:51,224 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 106 [2024-11-13 23:10:51,408 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:10:51,410 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 207 [2024-11-13 23:10:51,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:10:51,725 INFO L349 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2024-11-13 23:10:51,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 233 [2024-11-13 23:10:51,773 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-13 23:10:51,876 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 23:10:51,876 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 36 [2024-11-13 23:10:51,887 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-13 23:10:51,921 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:10:51,922 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2024-11-13 23:10:51,943 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 14 treesize of output 12 [2024-11-13 23:10:52,084 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 16 treesize of output 11 [2024-11-13 23:10:52,245 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 16 treesize of output 11 [2024-11-13 23:10:52,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:10:52,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:10:52,573 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2024-11-13 23:10:52,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:10:52,785 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2024-11-13 23:10:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:10:53,335 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (= c_~N~0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse2 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse3 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse9 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= c_~N~0 (select .cse1 0)) .cse2 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) .cse3 (not (and .cse0 (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse4 .cse5) (= v_DerPreprocessor_10 .cse5) (= .cse6 (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse6 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse2 .cse3 .cse9)) .cse9))) is different from false [2024-11-13 23:10:53,482 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (= c_~N~0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse2 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse3 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse9 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= c_~N~0 (select .cse1 0)) .cse2 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) .cse3 (not (and .cse0 (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse4 .cse5) (= v_DerPreprocessor_10 .cse5) (= .cse6 (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse6 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) .cse2 .cse3 .cse9)) .cse9)))) is different from true [2024-11-13 23:10:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:10:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 64 states and 177 transitions. [2024-11-13 23:10:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 177 transitions. [2024-11-13 23:10:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:10:54,656 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:10:54,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:10:54,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:10:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:10:54,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 23:10:54,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:10:54,849 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:10:54,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 23:10:54,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:10:54,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:10:54,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:10:54,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2024-11-13 23:10:54,874 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-13 23:10:54,880 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-13 23:10:54,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-13 23:10:54,956 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2024-11-13 23:10:55,030 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2024-11-13 23:10:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:10:55,654 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (= c_~N~0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse5 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse10 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= c_~N~0 (select .cse1 0)) .cse2 (= (select .cse3 0) 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not .cse4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse5 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse7) (= v_DerPreprocessor_10 .cse7) (= .cse3 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse3 (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse4)) .cse2 .cse5 .cse10)) .cse10))) is different from false [2024-11-13 23:10:55,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse13 0))) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse0 (= c_~N~0 (select .cse13 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse12 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and .cse1 .cse2 .cse3 (= (select .cse4 0) 1) .cse5 (not .cse6) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse7)) .cse1 .cse2 .cse3 .cse5 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse8 .cse9) (= v_DerPreprocessor_10 .cse9) (= .cse4 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse4 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse6)) .cse3 .cse7 .cse12)) .cse12))) is different from false [2024-11-13 23:10:55,670 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (= c_~N~0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse5 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse10 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= c_~N~0 (select .cse1 0)) .cse2 (= (select .cse3 0) 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not .cse4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse5 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse7) (= v_DerPreprocessor_10 .cse7) (= .cse3 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse3 (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse4)) .cse2 .cse5 .cse10)) .cse10)))) is different from true [2024-11-13 23:10:55,678 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse13 0))) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse0 (= c_~N~0 (select .cse13 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse12 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and .cse1 .cse2 .cse3 (= (select .cse4 0) 1) .cse5 (not .cse6) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse7)) .cse1 .cse2 .cse3 .cse5 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse8 .cse9) (= v_DerPreprocessor_10 .cse9) (= .cse4 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse4 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse6)) .cse3 .cse7 .cse12)) .cse12)))) is different from true [2024-11-13 23:10:56,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:10:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 65 states and 183 transitions. [2024-11-13 23:10:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 183 transitions. [2024-11-13 23:10:56,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:10:56,014 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:10:56,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:10:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:10:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:10:56,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-13 23:10:56,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:10:56,172 INFO L349 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2024-11-13 23:10:56,172 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 2 case distinctions, treesize of input 59 treesize of output 33 [2024-11-13 23:10:56,203 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:10:56,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 23:10:56,502 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:10:56,503 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2024-11-13 23:10:57,103 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 23:10:57,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2024-11-13 23:10:57,725 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-13 23:10:57,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 60 [2024-11-13 23:10:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:10:59,144 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (= c_~N~0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse5 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse10 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= c_~N~0 (select .cse1 0)) .cse2 (= (select .cse3 0) 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not .cse4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse5 (= (select .cse6 0) 6) (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse7) (= v_DerPreprocessor_10 .cse7) (= .cse3 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse3 (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse4)) .cse2 .cse5 .cse10)) .cse10))) is different from false [2024-11-13 23:10:59,363 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse15 0))) (.cse4 (= (select .cse12 0) 1)) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse0 (= c_~N~0 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse9 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 .cse1 .cse2 (not (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (select .cse8 0) 6) .cse9)) .cse3 .cse4 .cse5 (not .cse10) .cse6 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse8 .cse11) (= v_DerPreprocessor_10 .cse11) (= .cse12 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse12 (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse10)) .cse3 .cse7 .cse9)) .cse9))) is different from false [2024-11-13 23:10:59,371 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse0 (= c_~N~0 (select .cse1 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse5 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse10 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= c_~N~0 (select .cse1 0)) .cse2 (= (select .cse3 0) 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not .cse4) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse5 (= (select .cse6 0) 6) (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse6 .cse7) (= v_DerPreprocessor_10 .cse7) (= .cse3 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse3 (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse4)) .cse2 .cse5 .cse10)) .cse10)))) is different from true [2024-11-13 23:10:59,376 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse15 0))) (.cse4 (= (select .cse12 0) 1)) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse0 (= c_~N~0 (select .cse15 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse9 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 .cse1 .cse2 (not (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= (select .cse8 0) 6) .cse9)) .cse3 .cse4 .cse5 (not .cse10) .cse6 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse8 .cse11) (= v_DerPreprocessor_10 .cse11) (= .cse12 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse12 (select .cse14 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse14 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse10)) .cse3 .cse7 .cse9)) .cse9)))) is different from true [2024-11-13 23:11:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:11:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 66 states and 189 transitions. [2024-11-13 23:11:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 189 transitions. [2024-11-13 23:11:01,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:11:01,650 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:11:01,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:11:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:11:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 23:11:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:11:02,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 67 states and 190 transitions. [2024-11-13 23:11:02,332 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 190 transitions. [2024-11-13 23:11:02,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:11:02,332 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:11:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:11:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:11:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:11:02,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-13 23:11:02,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:11:02,709 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 14 treesize of output 12 [2024-11-13 23:11:02,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:02,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:02,739 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 23:11:02,740 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 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 23:11:02,747 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-13 23:11:02,820 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 16 treesize of output 11 [2024-11-13 23:11:02,841 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 16 treesize of output 11 [2024-11-13 23:11:02,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:02,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:02,941 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2024-11-13 23:11:03,242 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2024-11-13 23:11:03,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:11:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:11:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 67 states and 190 transitions. [2024-11-13 23:11:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 190 transitions. [2024-11-13 23:11:04,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:11:04,686 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:11:04,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:11:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:11:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:11:05,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 23:11:05,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:11:05,134 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 23:11:05,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2024-11-13 23:11:05,146 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-13 23:11:05,209 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-13 23:11:05,232 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-13 23:11:05,250 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-13 23:11:05,323 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:05,331 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:05,351 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-13 23:11:05,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 113 [2024-11-13 23:11:05,409 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-13 23:11:05,521 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:05,528 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:05,531 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:05,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 51 treesize of output 29 [2024-11-13 23:11:05,540 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-13 23:11:05,600 INFO L349 Elim1Store]: treesize reduction 47, result has 26.6 percent of original size [2024-11-13 23:11:05,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 125 treesize of output 113 [2024-11-13 23:11:05,615 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:05,616 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2024-11-13 23:11:05,688 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:05,689 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2024-11-13 23:11:05,724 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:05,725 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 88 [2024-11-13 23:11:05,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 14 treesize of output 12 [2024-11-13 23:11:16,359 WARN L286 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:11:16,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:16,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:16,448 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-13 23:11:16,448 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 143 [2024-11-13 23:11:16,461 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 77 treesize of output 75 [2024-11-13 23:11:16,509 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 16 treesize of output 11 [2024-11-13 23:11:16,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:16,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:16,573 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2024-11-13 23:11:16,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:16,781 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2024-11-13 23:11:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:11:17,273 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse13 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse5 (= c_~N~0 (select .cse23 0))) (.cse15 (= (select .cse2 0) 1)) (.cse16 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (not .cse7)) (.cse17 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse12 (= c_~N~0 (select .cse23 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse18 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_36))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_35 .cse0) (= v_DerPreprocessor_36 (store .cse1 0 c_~N~0)) (= .cse2 .cse0) (= .cse3 .cse1))))) .cse5 .cse6) (and .cse5 (or (and .cse7 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (and (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_31) (= c_~N~0 (select v_DerPreprocessor_33 0)) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse3 .cse9) (= (store .cse9 0 c_~N~0) v_DerPreprocessor_33) (= .cse10 .cse9) (= .cse10 v_DerPreprocessor_31) (= .cse9 v_DerPreprocessor_32) (= .cse2 .cse9)))))))) .cse12 .cse13 .cse5 (not (and .cse13 .cse5 .cse14 .cse15 .cse16 .cse17 .cse18 (= (select .cse3 0) 6) .cse19)) .cse14 .cse15 .cse16 .cse6 .cse17 .cse18 (not (and .cse12 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse3 .cse20) (= v_DerPreprocessor_10 .cse20) (= .cse2 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse2 (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse7)) .cse14 .cse18 .cse19)) .cse19))) is different from false [2024-11-13 23:11:27,865 WARN L286 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:11:27,871 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse17 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (= c_~N~0 (select .cse23 0))) (.cse18 (= (select .cse3 0) 1)) (.cse14 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse7 (not .cse8)) (.cse19 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse0 (= c_~N~0 (select .cse23 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse13 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse15 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse16 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and (or (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_36))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_35 .cse1) (= v_DerPreprocessor_36 (store .cse2 0 c_~N~0)) (= .cse3 .cse1) (= .cse4 .cse2))))) .cse6 .cse7) (and .cse6 (or (and .cse8 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (and (= (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_31) (= c_~N~0 (select v_DerPreprocessor_33 0)) (= .cse3 (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse4 .cse10) (= (store .cse10 0 c_~N~0) v_DerPreprocessor_33) (= .cse11 .cse10) (= .cse11 v_DerPreprocessor_31) (= .cse10 v_DerPreprocessor_32) (= .cse3 .cse10)))))))) .cse13 .cse14 .cse15 .cse16)) .cse17 .cse6 (not (and .cse17 .cse6 .cse13 .cse18 .cse14 .cse19 .cse15 (= (select .cse4 0) 6) .cse16)) .cse13 .cse18 .cse14 .cse7 .cse19 .cse15 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse4 .cse20) (= v_DerPreprocessor_10 .cse20) (= .cse3 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse3 (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse8)) .cse13 .cse15 .cse16)) .cse16))) is different from false [2024-11-13 23:11:27,884 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse7 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse13 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse5 (= c_~N~0 (select .cse23 0))) (.cse15 (= (select .cse2 0) 1)) (.cse16 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (not .cse7)) (.cse17 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse12 (= c_~N~0 (select .cse23 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse18 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_36))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_35 .cse0) (= v_DerPreprocessor_36 (store .cse1 0 c_~N~0)) (= .cse2 .cse0) (= .cse3 .cse1))))) .cse5 .cse6) (and .cse5 (or (and .cse7 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (and (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_31) (= c_~N~0 (select v_DerPreprocessor_33 0)) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse3 .cse9) (= (store .cse9 0 c_~N~0) v_DerPreprocessor_33) (= .cse10 .cse9) (= .cse10 v_DerPreprocessor_31) (= .cse9 v_DerPreprocessor_32) (= .cse2 .cse9)))))))) .cse12 .cse13 .cse5 (not (and .cse13 .cse5 .cse14 .cse15 .cse16 .cse17 .cse18 (= (select .cse3 0) 6) .cse19)) .cse14 .cse15 .cse16 .cse6 .cse17 .cse18 (not (and .cse12 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse3 .cse20) (= v_DerPreprocessor_10 .cse20) (= .cse2 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse2 (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse7)) .cse14 .cse18 .cse19)) .cse19)))) is different from true [2024-11-13 23:11:27,897 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse8 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse17 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (= c_~N~0 (select .cse23 0))) (.cse18 (= (select .cse3 0) 1)) (.cse14 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse7 (not .cse8)) (.cse19 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse0 (= c_~N~0 (select .cse23 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse13 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse15 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse16 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and (or (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_36))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse2 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_35 .cse1) (= v_DerPreprocessor_36 (store .cse2 0 c_~N~0)) (= .cse3 .cse1) (= .cse4 .cse2))))) .cse6 .cse7) (and .cse6 (or (and .cse8 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (and (= (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_31) (= c_~N~0 (select v_DerPreprocessor_33 0)) (= .cse3 (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse4 .cse10) (= (store .cse10 0 c_~N~0) v_DerPreprocessor_33) (= .cse11 .cse10) (= .cse11 v_DerPreprocessor_31) (= .cse10 v_DerPreprocessor_32) (= .cse3 .cse10)))))))) .cse13 .cse14 .cse15 .cse16)) .cse17 .cse6 (not (and .cse17 .cse6 .cse13 .cse18 .cse14 .cse19 .cse15 (= (select .cse4 0) 6) .cse16)) .cse13 .cse18 .cse14 .cse7 .cse19 .cse15 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse4 .cse20) (= v_DerPreprocessor_10 .cse20) (= .cse3 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse3 (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse8)) .cse13 .cse15 .cse16)) .cse16)))) is different from true [2024-11-13 23:11:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:11:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 68 states and 196 transitions. [2024-11-13 23:11:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 196 transitions. [2024-11-13 23:11:27,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:11:27,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:11:27,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:11:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:11:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:11:28,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-13 23:11:28,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:11:28,390 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 23:11:28,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2024-11-13 23:11:28,406 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-13 23:11:28,432 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-13 23:11:28,456 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-13 23:11:28,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:28,555 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 8 treesize of output 1 [2024-11-13 23:11:28,635 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:28,644 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:28,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 81 treesize of output 55 [2024-11-13 23:11:28,670 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-13 23:11:28,702 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:28,714 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:28,733 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-13 23:11:28,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 88 treesize of output 68 [2024-11-13 23:11:28,761 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-13 23:11:28,813 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:28,815 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 169 [2024-11-13 23:11:28,922 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:28,923 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2024-11-13 23:11:28,996 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:28,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2024-11-13 23:11:29,037 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:29,039 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 198 [2024-11-13 23:11:29,199 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 14 treesize of output 12 [2024-11-13 23:11:29,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:29,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:29,980 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-13 23:11:29,980 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 143 treesize of output 143 [2024-11-13 23:11:29,992 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 89 treesize of output 87 [2024-11-13 23:11:30,044 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 16 treesize of output 11 [2024-11-13 23:11:30,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:30,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:30,128 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2024-11-13 23:11:30,393 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2024-11-13 23:11:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:11:30,450 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse21 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse14 (= c_~N~0 (select .cse31 0))) (.cse23 (= (select .cse1 0) 1)) (.cse24 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse15 (not .cse7)) (.cse25 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse20 (= c_~N~0 (select .cse31 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse22 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse26 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse27 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse0 .cse1) (= .cse2 .cse3) (exists ((v_prenex_52 (Array Int Int)) (v_prenex_51 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_51) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_52) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 0 c_~N~0)))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse4 .cse2) (= .cse4 v_prenex_51) (= .cse0 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (= v_DerPreprocessor_48 (store .cse0 0 c_~N~0)) (= v_DerPreprocessor_46 .cse3))))) (and .cse7 (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_42))) (and (= .cse8 (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse8 .cse1) (= v_DerPreprocessor_48 (store .cse8 0 c_~N~0)) (= c_~N~0 (select v_DerPreprocessor_42 0)) (= v_DerPreprocessor_40 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)) (= v_DerPreprocessor_46 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (or (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_36))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_35 .cse11) (= v_DerPreprocessor_36 (store .cse12 0 c_~N~0)) (= .cse1 .cse11) (= .cse2 .cse12))))) .cse14 .cse15) (and .cse14 (or (and .cse7 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (and (= (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_31) (= c_~N~0 (select v_DerPreprocessor_33 0)) (= .cse1 (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (select .cse19 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse2 .cse17) (= (store .cse17 0 c_~N~0) v_DerPreprocessor_33) (= .cse18 .cse17) (= .cse18 v_DerPreprocessor_31) (= .cse17 v_DerPreprocessor_32) (= .cse1 .cse17)))))))) .cse20 .cse21 .cse14 (not (and .cse21 .cse14 .cse22 .cse23 .cse24 .cse25 .cse26 (= (select .cse2 0) 6) .cse27)) .cse22 .cse23 .cse24 .cse15 .cse25 .cse26 (not (and .cse20 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse28 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse2 .cse28) (= v_DerPreprocessor_10 .cse28) (= .cse1 (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse1 (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse7)) .cse22 .cse26 .cse27)) .cse27))) is different from false [2024-11-13 23:11:31,045 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse21 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse5 (= c_~N~0 (select .cse31 0))) (.cse26 (= (select .cse2 0) 1)) (.cse23 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (not .cse7)) (.cse27 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse12 (= c_~N~0 (select .cse31 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse22 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse24 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse25 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_36))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_35 .cse0) (= v_DerPreprocessor_36 (store .cse1 0 c_~N~0)) (= .cse2 .cse0) (= .cse3 .cse1))))) .cse5 .cse6) (and .cse5 (or (and .cse7 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (and (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_31) (= c_~N~0 (select v_DerPreprocessor_33 0)) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse3 .cse9) (= (store .cse9 0 c_~N~0) v_DerPreprocessor_33) (= .cse10 .cse9) (= .cse10 v_DerPreprocessor_31) (= .cse9 v_DerPreprocessor_32) (= .cse2 .cse9)))))))) .cse12 (not (and (or (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse14 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse13 .cse2) (= .cse3 .cse14) (exists ((v_prenex_52 (Array Int Int)) (v_prenex_51 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_51) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_52) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 0 c_~N~0)))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse15 .cse3) (= .cse15 v_prenex_51) (= .cse13 (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (= v_DerPreprocessor_48 (store .cse13 0 c_~N~0)) (= v_DerPreprocessor_46 .cse14))))) (and .cse7 (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_42))) (and (= .cse18 (select .cse19 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse18 .cse2) (= v_DerPreprocessor_48 (store .cse18 0 c_~N~0)) (= c_~N~0 (select v_DerPreprocessor_42 0)) (= v_DerPreprocessor_40 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|)) (= v_DerPreprocessor_46 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) .cse21 .cse5 .cse22 .cse23 .cse24 .cse25)) .cse21 .cse5 (not (and .cse21 .cse5 .cse22 .cse26 .cse23 .cse27 .cse24 (= (select .cse3 0) 6) .cse25)) .cse22 .cse26 .cse23 .cse6 .cse27 .cse24 (not (and .cse12 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse28 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse3 .cse28) (= v_DerPreprocessor_10 .cse28) (= .cse2 (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse2 (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse7)) .cse22 .cse24 .cse25)) .cse25))) is different from false [2024-11-13 23:11:31,058 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse7 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse21 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse14 (= c_~N~0 (select .cse31 0))) (.cse23 (= (select .cse1 0) 1)) (.cse24 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse15 (not .cse7)) (.cse25 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse20 (= c_~N~0 (select .cse31 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse22 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse26 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse27 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse0 .cse1) (= .cse2 .cse3) (exists ((v_prenex_52 (Array Int Int)) (v_prenex_51 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_51) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_52) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 0 c_~N~0)))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse4 .cse2) (= .cse4 v_prenex_51) (= .cse0 (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (= v_DerPreprocessor_48 (store .cse0 0 c_~N~0)) (= v_DerPreprocessor_46 .cse3))))) (and .cse7 (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_42))) (and (= .cse8 (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse8 .cse1) (= v_DerPreprocessor_48 (store .cse8 0 c_~N~0)) (= c_~N~0 (select v_DerPreprocessor_42 0)) (= v_DerPreprocessor_40 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)) (= v_DerPreprocessor_46 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) (or (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_36))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse12 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_35 .cse11) (= v_DerPreprocessor_36 (store .cse12 0 c_~N~0)) (= .cse1 .cse11) (= .cse2 .cse12))))) .cse14 .cse15) (and .cse14 (or (and .cse7 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (and (= (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_31) (= c_~N~0 (select v_DerPreprocessor_33 0)) (= .cse1 (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (let ((.cse18 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse17 (select .cse19 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse2 .cse17) (= (store .cse17 0 c_~N~0) v_DerPreprocessor_33) (= .cse18 .cse17) (= .cse18 v_DerPreprocessor_31) (= .cse17 v_DerPreprocessor_32) (= .cse1 .cse17)))))))) .cse20 .cse21 .cse14 (not (and .cse21 .cse14 .cse22 .cse23 .cse24 .cse25 .cse26 (= (select .cse2 0) 6) .cse27)) .cse22 .cse23 .cse24 .cse15 .cse25 .cse26 (not (and .cse20 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse28 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse2 .cse28) (= v_DerPreprocessor_10 .cse28) (= .cse1 (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse1 (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse7)) .cse22 .cse26 .cse27)) .cse27)))) is different from true [2024-11-13 23:11:31,074 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse7 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse31 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse21 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse5 (= c_~N~0 (select .cse31 0))) (.cse26 (= (select .cse2 0) 1)) (.cse23 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (not .cse7)) (.cse27 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse12 (= c_~N~0 (select .cse31 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse22 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse24 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse25 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and (or (and (exists ((v_DerPreprocessor_34 (Array Int Int)) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_34) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_35) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_36))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= v_DerPreprocessor_35 .cse0) (= v_DerPreprocessor_36 (store .cse1 0 c_~N~0)) (= .cse2 .cse0) (= .cse3 .cse1))))) .cse5 .cse6) (and .cse5 (or (and .cse7 (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (and (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_31) (= c_~N~0 (select v_DerPreprocessor_33 0)) (= .cse2 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (exists ((v_DerPreprocessor_31 (Array Int Int)) (v_DerPreprocessor_32 (Array Int Int)) (v_DerPreprocessor_33 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_33))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse3 .cse9) (= (store .cse9 0 c_~N~0) v_DerPreprocessor_33) (= .cse10 .cse9) (= .cse10 v_DerPreprocessor_31) (= .cse9 v_DerPreprocessor_32) (= .cse2 .cse9)))))))) .cse12 (not (and (or (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse14 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse13 .cse2) (= .cse3 .cse14) (exists ((v_prenex_52 (Array Int Int)) (v_prenex_51 (Array Int Int))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_prenex_51) |c_ULTIMATE.start_main_~b~0#1.base| v_prenex_52) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 0 c_~N~0)))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse15 .cse3) (= .cse15 v_prenex_51) (= .cse13 (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (= v_DerPreprocessor_48 (store .cse13 0 c_~N~0)) (= v_DerPreprocessor_46 .cse14))))) (and .cse7 (exists ((v_DerPreprocessor_40 (Array Int Int)) (v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_48))) (let ((.cse18 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse19 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_40) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_42))) (and (= .cse18 (select .cse19 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse18 .cse2) (= v_DerPreprocessor_48 (store .cse18 0 c_~N~0)) (= c_~N~0 (select v_DerPreprocessor_42 0)) (= v_DerPreprocessor_40 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|)) (= v_DerPreprocessor_46 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|)))))))) .cse21 .cse5 .cse22 .cse23 .cse24 .cse25)) .cse21 .cse5 (not (and .cse21 .cse5 .cse22 .cse26 .cse23 .cse27 .cse24 (= (select .cse3 0) 6) .cse25)) .cse22 .cse26 .cse23 .cse6 .cse27 .cse24 (not (and .cse12 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse29 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse28 (select .cse29 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse3 .cse28) (= v_DerPreprocessor_10 .cse28) (= .cse2 (select .cse29 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse2 (select .cse30 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse7)) .cse22 .cse24 .cse25)) .cse25)))) is different from true [2024-11-13 23:11:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:11:31,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 69 states and 202 transitions. [2024-11-13 23:11:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 202 transitions. [2024-11-13 23:11:31,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:11:31,125 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:11:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:11:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:11:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:11:31,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 23:11:31,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:11:31,379 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 14 treesize of output 12 [2024-11-13 23:11:31,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:31,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:31,407 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 23:11:31,408 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 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 23:11:31,415 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-13 23:11:31,642 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 16 treesize of output 11 [2024-11-13 23:11:31,654 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 16 treesize of output 11 [2024-11-13 23:11:31,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:31,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:31,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-13 23:11:31,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:31,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 52 [2024-11-13 23:11:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:11:32,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:11:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 69 states and 202 transitions. [2024-11-13 23:11:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 202 transitions. [2024-11-13 23:11:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:11:32,257 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:11:32,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:11:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:11:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:11:32,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 23:11:32,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:11:32,522 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 14 treesize of output 12 [2024-11-13 23:11:32,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:32,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:32,548 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 23:11:32,548 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 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 23:11:32,554 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-13 23:11:32,563 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 16 treesize of output 11 [2024-11-13 23:11:32,576 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 16 treesize of output 11 [2024-11-13 23:11:32,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:32,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:32,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-13 23:11:32,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:32,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 52 [2024-11-13 23:11:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:11:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:11:33,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 69 states and 202 transitions. [2024-11-13 23:11:33,098 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 202 transitions. [2024-11-13 23:11:33,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:11:33,099 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:11:33,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:11:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:11:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:11:33,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 23:11:33,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:11:33,450 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 23:11:33,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2024-11-13 23:11:33,465 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-13 23:11:33,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-13 23:11:33,536 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-13 23:11:33,554 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-13 23:11:33,621 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:33,622 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 140 [2024-11-13 23:11:33,805 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:33,807 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 140 [2024-11-13 23:11:34,063 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:34,065 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 348 [2024-11-13 23:11:34,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:34,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:34,302 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:34,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 81 [2024-11-13 23:11:34,311 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-13 23:11:34,336 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:34,338 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 303 [2024-11-13 23:11:34,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:34,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:34,540 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 23:11:34,540 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 73 [2024-11-13 23:11:34,550 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-13 23:11:34,594 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 14 treesize of output 12 [2024-11-13 23:11:34,607 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 16 treesize of output 11 [2024-11-13 23:11:34,626 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 16 treesize of output 11 [2024-11-13 23:11:34,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:34,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:34,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-13 23:11:34,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:34,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 52 [2024-11-13 23:11:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:11:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:11:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 69 states and 202 transitions. [2024-11-13 23:11:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 202 transitions. [2024-11-13 23:11:34,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:11:34,933 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:11:34,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:11:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:11:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:11:35,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 23:11:35,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:11:35,178 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 14 treesize of output 12 [2024-11-13 23:11:35,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:35,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:35,203 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 23:11:35,204 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 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 23:11:35,207 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-13 23:11:35,224 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 16 treesize of output 11 [2024-11-13 23:11:35,239 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 16 treesize of output 11 [2024-11-13 23:11:35,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:35,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:35,298 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2024-11-13 23:11:35,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:35,319 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2024-11-13 23:11:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:11:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:11:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 69 states and 202 transitions. [2024-11-13 23:11:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 202 transitions. [2024-11-13 23:11:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:11:35,929 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:11:35,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:11:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:11:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:11:36,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-13 23:11:36,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:11:36,253 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 23:11:36,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2024-11-13 23:11:36,268 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-13 23:11:36,329 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-13 23:11:36,349 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-13 23:11:36,369 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-13 23:11:36,510 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:36,512 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 132 [2024-11-13 23:11:36,648 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:36,661 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 23:11:36,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 90 [2024-11-13 23:11:36,673 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-13 23:11:36,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:36,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:36,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:36,797 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 23:11:36,797 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 88 [2024-11-13 23:11:36,809 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-13 23:11:36,841 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:36,841 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2024-11-13 23:11:36,865 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:36,865 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2024-11-13 23:11:36,883 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:36,885 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 232 [2024-11-13 23:11:37,093 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:11:37,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 23:11:37,301 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 16 treesize of output 11 [2024-11-13 23:11:37,510 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 16 treesize of output 11 [2024-11-13 23:11:37,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:37,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:37,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-13 23:11:37,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:37,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 52 [2024-11-13 23:11:37,838 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:11:37,845 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse14 0))) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (not .cse12)) (.cse0 (= c_~N~0 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse13 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and .cse1 .cse2 .cse3 (= (select .cse4 0) 1) .cse5 .cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse7)) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse8 .cse9) (= v_DerPreprocessor_10 .cse9) (= .cse4 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse4 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse12)) .cse3 .cse7 .cse13)) .cse13))) is different from false [2024-11-13 23:11:38,029 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse13 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (not .cse13)) (.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse14 0))) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse0 (= c_~N~0 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse8 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and .cse1 .cse2 .cse3 (= (select .cse4 0) 1) .cse5 .cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse7)) (not (and .cse0 .cse3 .cse6 .cse7 .cse8)) .cse1 .cse2 .cse3 .cse5 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse9 .cse10) (= v_DerPreprocessor_10 .cse10) (= .cse4 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse4 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse13)) .cse3 .cse7 .cse8)) .cse8))) is different from false [2024-11-13 23:11:38,036 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse12 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse14 0))) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (not .cse12)) (.cse0 (= c_~N~0 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse13 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and .cse1 .cse2 .cse3 (= (select .cse4 0) 1) .cse5 .cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse7)) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse8 .cse9) (= v_DerPreprocessor_10 .cse9) (= .cse4 (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse4 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse12)) .cse3 .cse7 .cse13)) .cse13)))) is different from true [2024-11-13 23:11:38,042 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse13 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse6 (not .cse13)) (.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse14 0))) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse0 (= c_~N~0 (select .cse14 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse8 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and .cse1 .cse2 .cse3 (= (select .cse4 0) 1) .cse5 .cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse7)) (not (and .cse0 .cse3 .cse6 .cse7 .cse8)) .cse1 .cse2 .cse3 .cse5 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse9 .cse10) (= v_DerPreprocessor_10 .cse10) (= .cse4 (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|))))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse4 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse13)) .cse3 .cse7 .cse8)) .cse8)))) is different from true [2024-11-13 23:11:38,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:11:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 70 states and 208 transitions. [2024-11-13 23:11:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 208 transitions. [2024-11-13 23:11:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:11:38,265 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:11:38,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:11:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:11:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:11:38,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-13 23:11:38,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:11:38,610 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 23:11:38,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2024-11-13 23:11:38,628 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-13 23:11:38,648 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-13 23:11:38,667 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-13 23:11:38,725 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-13 23:11:38,793 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:38,800 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:38,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 90 [2024-11-13 23:11:38,812 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-13 23:11:38,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:38,927 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:38,944 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-13 23:11:38,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 98 [2024-11-13 23:11:38,998 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-13 23:11:39,029 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:39,031 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 196 [2024-11-13 23:11:39,040 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:39,041 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 184 [2024-11-13 23:11:39,211 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:39,212 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2024-11-13 23:11:39,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 32 [2024-11-13 23:11:39,339 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 14 treesize of output 12 [2024-11-13 23:11:50,028 WARN L286 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:11:50,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:50,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:50,087 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-13 23:11:50,087 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 191 [2024-11-13 23:11:50,129 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 102 treesize of output 100 [2024-11-13 23:11:50,179 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 16 treesize of output 11 [2024-11-13 23:11:50,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:50,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:11:50,252 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2024-11-13 23:11:50,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:50,521 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2024-11-13 23:11:50,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:11:50,922 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse23 0))) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (not .cse11)) (.cse0 (= c_~N~0 (select .cse23 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse22 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and .cse1 .cse2 .cse3 (= (select .cse4 0) 1) .cse5 .cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse7)) (or (and (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75)) (.cse10 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= c_~N~0 (select v_DerPreprocessor_75 0)) (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_76) (= v_DerPreprocessor_73 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (store .cse10 0 c_~N~0) v_DerPreprocessor_78) (= (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) (= .cse4 .cse10))))) .cse11) (exists ((v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (select .cse18 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse12 v_DerPreprocessor_76) (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_75 (store .cse13 0 c_~N~0)) (= .cse12 .cse13) (= .cse14 .cse13) (= v_DerPreprocessor_73 .cse13) (= v_DerPreprocessor_74 .cse15) (= .cse15 .cse16))))) (= (store .cse16 0 c_~N~0) v_DerPreprocessor_78) (= v_DerPreprocessor_77 .cse16) (= .cse4 .cse16)))))) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse14 .cse19) (= v_DerPreprocessor_10 .cse19) (= .cse4 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse4 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse11)) .cse3 .cse7 .cse22)) .cse22))) is different from false [2024-11-13 23:11:51,554 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse23 0))) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (not .cse11)) (.cse0 (= c_~N~0 (select .cse23 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and .cse1 .cse2 .cse3 (= (select .cse4 0) 1) .cse5 .cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse7)) .cse1 .cse2 .cse3 (not (and (or (and (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75)) (.cse10 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= c_~N~0 (select v_DerPreprocessor_75 0)) (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_76) (= v_DerPreprocessor_73 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (store .cse10 0 c_~N~0) v_DerPreprocessor_78) (= (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) (= .cse4 .cse10))))) .cse11) (exists ((v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (select .cse18 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse12 v_DerPreprocessor_76) (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_75 (store .cse13 0 c_~N~0)) (= .cse12 .cse13) (= .cse14 .cse13) (= v_DerPreprocessor_73 .cse13) (= v_DerPreprocessor_74 .cse15) (= .cse15 .cse16))))) (= (store .cse16 0 c_~N~0) v_DerPreprocessor_78) (= v_DerPreprocessor_77 .cse16) (= .cse4 .cse16)))))) .cse2 .cse3 .cse5 .cse7 .cse19)) .cse5 .cse6 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse14 .cse20) (= v_DerPreprocessor_10 .cse20) (= .cse4 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse4 (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse11)) .cse3 .cse7 .cse19)) .cse19))) is different from false [2024-11-13 23:11:51,565 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse11 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse23 0))) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (not .cse11)) (.cse0 (= c_~N~0 (select .cse23 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse22 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and .cse1 .cse2 .cse3 (= (select .cse4 0) 1) .cse5 .cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse7)) (or (and (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75)) (.cse10 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= c_~N~0 (select v_DerPreprocessor_75 0)) (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_76) (= v_DerPreprocessor_73 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (store .cse10 0 c_~N~0) v_DerPreprocessor_78) (= (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) (= .cse4 .cse10))))) .cse11) (exists ((v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (select .cse18 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse12 v_DerPreprocessor_76) (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_75 (store .cse13 0 c_~N~0)) (= .cse12 .cse13) (= .cse14 .cse13) (= v_DerPreprocessor_73 .cse13) (= v_DerPreprocessor_74 .cse15) (= .cse15 .cse16))))) (= (store .cse16 0 c_~N~0) v_DerPreprocessor_78) (= v_DerPreprocessor_77 .cse16) (= .cse4 .cse16)))))) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse14 .cse19) (= v_DerPreprocessor_10 .cse19) (= .cse4 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse4 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse11)) .cse3 .cse7 .cse22)) .cse22)))) is different from true [2024-11-13 23:11:51,573 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse11 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse23 0))) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (not .cse11)) (.cse0 (= c_~N~0 (select .cse23 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and .cse1 .cse2 .cse3 (= (select .cse4 0) 1) .cse5 .cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse7)) .cse1 .cse2 .cse3 (not (and (or (and (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75)) (.cse10 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= c_~N~0 (select v_DerPreprocessor_75 0)) (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_76) (= v_DerPreprocessor_73 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (store .cse10 0 c_~N~0) v_DerPreprocessor_78) (= (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) (= .cse4 .cse10))))) .cse11) (exists ((v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (select .cse18 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse12 v_DerPreprocessor_76) (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_75 (store .cse13 0 c_~N~0)) (= .cse12 .cse13) (= .cse14 .cse13) (= v_DerPreprocessor_73 .cse13) (= v_DerPreprocessor_74 .cse15) (= .cse15 .cse16))))) (= (store .cse16 0 c_~N~0) v_DerPreprocessor_78) (= v_DerPreprocessor_77 .cse16) (= .cse4 .cse16)))))) .cse2 .cse3 .cse5 .cse7 .cse19)) .cse5 .cse6 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse20 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse14 .cse20) (= v_DerPreprocessor_10 .cse20) (= .cse4 (select .cse21 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse4 (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse11)) .cse3 .cse7 .cse19)) .cse19)))) is different from true [2024-11-13 23:11:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:11:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 71 states and 214 transitions. [2024-11-13 23:11:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 214 transitions. [2024-11-13 23:11:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:11:51,599 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:11:51,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:11:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:11:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:11:51,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 23:11:51,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:11:52,012 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 23:11:52,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2024-11-13 23:11:52,030 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-13 23:11:52,100 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-13 23:11:52,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:11:52,121 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 8 treesize of output 1 [2024-11-13 23:11:52,178 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-13 23:11:52,253 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:52,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:52,260 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:52,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 51 treesize of output 29 [2024-11-13 23:11:52,268 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-13 23:11:52,304 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:52,310 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:52,329 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-11-13 23:11:52,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 89 treesize of output 75 [2024-11-13 23:11:52,390 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-13 23:11:52,444 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:11:52,456 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 23:11:52,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 31 [2024-11-13 23:11:52,464 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-13 23:11:52,504 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 23:11:52,504 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 54 [2024-11-13 23:11:52,508 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:52,509 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2024-11-13 23:11:52,524 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-13 23:11:52,581 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:11:52,582 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2024-11-13 23:11:52,603 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 14 treesize of output 12 [2024-11-13 23:12:13,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:12:13,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:12:13,079 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-13 23:12:13,079 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 80 [2024-11-13 23:12:13,101 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 16 treesize of output 11 [2024-11-13 23:12:13,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:12:13,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:12:13,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-13 23:12:13,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:13,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 52 [2024-11-13 23:12:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:12:13,322 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse27 0))) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (not .cse11)) (.cse0 (= c_~N~0 (select .cse27 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and .cse1 .cse2 .cse3 (= (select .cse4 0) 1) .cse5 .cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse7)) .cse1 .cse2 .cse3 (not (and (or (and (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75)) (.cse10 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= c_~N~0 (select v_DerPreprocessor_75 0)) (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_76) (= v_DerPreprocessor_73 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (store .cse10 0 c_~N~0) v_DerPreprocessor_78) (= (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) (= .cse4 .cse10))))) .cse11) (exists ((v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (select .cse18 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse12 v_DerPreprocessor_76) (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_75 (store .cse13 0 c_~N~0)) (= .cse12 .cse13) (= .cse14 .cse13) (= v_DerPreprocessor_73 .cse13) (= v_DerPreprocessor_74 .cse15) (= .cse15 .cse16))))) (= (store .cse16 0 c_~N~0) v_DerPreprocessor_78) (= v_DerPreprocessor_77 .cse16) (= .cse4 .cse16)))))) .cse2 .cse3 .cse5 .cse7 .cse19)) (let ((.cse22 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (or (exists ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_main_~c~0#1.base| .cse22))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse4 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse21 .cse14) (= .cse21 v_DerPreprocessor_82))))) (and (exists ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_main_~c~0#1.base| .cse22))) (and (= .cse4 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_82)))) .cse11))) .cse5 .cse6 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse14 .cse24) (= v_DerPreprocessor_10 .cse24) (= .cse4 (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse4 (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse11)) .cse3 .cse7 .cse19)) .cse19))) is different from false [2024-11-13 23:12:23,772 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse27 0))) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (not .cse13)) (.cse0 (= c_~N~0 (select .cse27 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse14 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and .cse1 .cse2 .cse3 (= (select .cse4 0) 1) .cse5 .cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse7)) .cse1 .cse2 .cse3 (not (and .cse0 .cse3 (let ((.cse11 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (or (exists ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_main_~c~0#1.base| .cse11))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse4 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse9 .cse10) (= .cse9 v_DerPreprocessor_82))))) (and (exists ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_main_~c~0#1.base| .cse11))) (and (= .cse4 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_82)))) .cse13))) .cse7 .cse14)) (not (and (or (and (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75)) (.cse17 (select .cse15 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= c_~N~0 (select v_DerPreprocessor_75 0)) (= (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_76) (= v_DerPreprocessor_73 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (store .cse17 0 c_~N~0) v_DerPreprocessor_78) (= (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|) .cse17) (= .cse4 .cse17))))) .cse13) (exists ((v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse18 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse21 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse18 v_DerPreprocessor_76) (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75))) (let ((.cse19 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse20 (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_75 (store .cse19 0 c_~N~0)) (= .cse18 .cse19) (= .cse10 .cse19) (= v_DerPreprocessor_73 .cse19) (= v_DerPreprocessor_74 .cse20) (= .cse20 .cse21))))) (= (store .cse21 0 c_~N~0) v_DerPreprocessor_78) (= v_DerPreprocessor_77 .cse21) (= .cse4 .cse21)))))) .cse2 .cse3 .cse5 .cse7 .cse14)) .cse5 .cse6 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse10 .cse24) (= v_DerPreprocessor_10 .cse24) (= .cse4 (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse4 (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse13)) .cse3 .cse7 .cse14)) .cse14))) is different from false [2024-11-13 23:12:23,792 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse11 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse27 0))) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (not .cse11)) (.cse0 (= c_~N~0 (select .cse27 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse19 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and .cse1 .cse2 .cse3 (= (select .cse4 0) 1) .cse5 .cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse7)) .cse1 .cse2 .cse3 (not (and (or (and (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75)) (.cse10 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= c_~N~0 (select v_DerPreprocessor_75 0)) (= (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_76) (= v_DerPreprocessor_73 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (store .cse10 0 c_~N~0) v_DerPreprocessor_78) (= (select .cse9 |c_ULTIMATE.start_main_~b~0#1.base|) .cse10) (= .cse4 .cse10))))) .cse11) (exists ((v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse12 (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (select .cse18 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse12 v_DerPreprocessor_76) (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75))) (let ((.cse13 (select .cse17 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse15 (select .cse17 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_75 (store .cse13 0 c_~N~0)) (= .cse12 .cse13) (= .cse14 .cse13) (= v_DerPreprocessor_73 .cse13) (= v_DerPreprocessor_74 .cse15) (= .cse15 .cse16))))) (= (store .cse16 0 c_~N~0) v_DerPreprocessor_78) (= v_DerPreprocessor_77 .cse16) (= .cse4 .cse16)))))) .cse2 .cse3 .cse5 .cse7 .cse19)) (let ((.cse22 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (or (exists ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_main_~c~0#1.base| .cse22))) (let ((.cse21 (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse4 (select .cse20 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse21 .cse14) (= .cse21 v_DerPreprocessor_82))))) (and (exists ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_main_~c~0#1.base| .cse22))) (and (= .cse4 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_82)))) .cse11))) .cse5 .cse6 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse14 .cse24) (= v_DerPreprocessor_10 .cse24) (= .cse4 (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse4 (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse11)) .cse3 .cse7 .cse19)) .cse19)))) is different from true [2024-11-13 23:12:23,807 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse13 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse27 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (let ((.cse1 (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse2 (= c_~N~0 (select .cse27 0))) (.cse5 (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) (.cse6 (not .cse13)) (.cse0 (= c_~N~0 (select .cse27 |c_ULTIMATE.start_main_~c~0#1.offset|))) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse14 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (and .cse0 (not (and .cse1 .cse2 .cse3 (= (select .cse4 0) 1) .cse5 .cse6 (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) .cse7)) .cse1 .cse2 .cse3 (not (and .cse0 .cse3 (let ((.cse11 (store .cse4 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0))) (or (exists ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_main_~c~0#1.base| .cse11))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse4 (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse9 .cse10) (= .cse9 v_DerPreprocessor_82))))) (and (exists ((v_DerPreprocessor_82 (Array Int Int)) (v_DerPreprocessor_83 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_82) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_83) |c_ULTIMATE.start_main_~c~0#1.base| .cse11))) (and (= .cse4 (select .cse12 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse12 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_82)))) .cse13))) .cse7 .cse14)) (not (and (or (and (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int)) (v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75)) (.cse17 (select .cse15 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= c_~N~0 (select v_DerPreprocessor_75 0)) (= (select .cse15 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_76) (= v_DerPreprocessor_73 (select .cse16 |c_ULTIMATE.start_main_~a~0#1.base|)) (= (store .cse17 0 c_~N~0) v_DerPreprocessor_78) (= (select .cse16 |c_ULTIMATE.start_main_~b~0#1.base|) .cse17) (= .cse4 .cse17))))) .cse13) (exists ((v_DerPreprocessor_76 (Array Int Int)) (v_DerPreprocessor_77 (Array Int Int)) (v_DerPreprocessor_78 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_76) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_77) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_78))) (let ((.cse18 (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse21 (select .cse23 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= .cse18 v_DerPreprocessor_76) (exists ((v_DerPreprocessor_73 (Array Int Int)) (v_DerPreprocessor_74 (Array Int Int)) (v_DerPreprocessor_75 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_73) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_74) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_75))) (let ((.cse19 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse20 (select .cse22 |c_ULTIMATE.start_main_~b~0#1.base|))) (and (= v_DerPreprocessor_75 (store .cse19 0 c_~N~0)) (= .cse18 .cse19) (= .cse10 .cse19) (= v_DerPreprocessor_73 .cse19) (= v_DerPreprocessor_74 .cse20) (= .cse20 .cse21))))) (= (store .cse21 0 c_~N~0) v_DerPreprocessor_78) (= v_DerPreprocessor_77 .cse21) (= .cse4 .cse21)))))) .cse2 .cse3 .cse5 .cse7 .cse14)) .cse5 .cse6 .cse7 (not (and .cse0 (or (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (let ((.cse25 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_main_~c~0#1.offset| c_~N~0)))) (let ((.cse24 (select .cse25 |c_ULTIMATE.start_main_~a~0#1.base|))) (and (= .cse10 .cse24) (= v_DerPreprocessor_10 .cse24) (= .cse4 (select .cse25 |c_ULTIMATE.start_main_~b~0#1.base|)))))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int)) (v_DerPreprocessor_12 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_12))) (and (= c_~N~0 (select v_DerPreprocessor_12 |c_ULTIMATE.start_main_~c~0#1.offset|)) (= .cse4 (select .cse26 |c_ULTIMATE.start_main_~b~0#1.base|)) (= (select .cse26 |c_ULTIMATE.start_main_~a~0#1.base|) v_DerPreprocessor_10)))) .cse13)) .cse3 .cse7 .cse14)) .cse14)))) is different from true [2024-11-13 23:12:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:12:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 72 states and 220 transitions. [2024-11-13 23:12:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 220 transitions. [2024-11-13 23:12:23,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:12:23,826 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:12:23,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:12:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:12:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:12:24,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 23:12:24,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:12:24,055 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 14 treesize of output 12 [2024-11-13 23:12:24,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:12:24,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:12:24,076 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 23:12:24,076 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 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 23:12:24,082 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-13 23:12:24,091 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 16 treesize of output 11 [2024-11-13 23:12:24,105 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 16 treesize of output 11 [2024-11-13 23:12:24,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:12:24,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:12:24,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-11-13 23:12:24,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:24,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 52 [2024-11-13 23:12:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:12:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:12:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 72 states and 220 transitions. [2024-11-13 23:12:24,538 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 220 transitions. [2024-11-13 23:12:24,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:12:24,538 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:12:24,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:12:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:12:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:12:24,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 23:12:24,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:12:24,933 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2024-11-13 23:12:24,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 184 [2024-11-13 23:12:24,946 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-13 23:12:24,965 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-13 23:12:25,018 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-13 23:12:25,035 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-13 23:12:25,077 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:25,078 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 142 [2024-11-13 23:12:25,203 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:25,203 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 96 [2024-11-13 23:12:25,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:12:25,303 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:12:25,308 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:12:25,309 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:12:25,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 44 treesize of output 24 [2024-11-13 23:12:25,320 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-13 23:12:25,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:12:25,442 INFO L349 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2024-11-13 23:12:25,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 277 treesize of output 281 [2024-11-13 23:12:25,611 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-13 23:12:25,671 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-13 23:12:25,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 16 [2024-11-13 23:12:25,711 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:25,712 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2024-11-13 23:12:25,738 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:25,739 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2024-11-13 23:12:25,758 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:25,759 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2024-11-13 23:12:25,800 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 14 treesize of output 12 [2024-11-13 23:12:25,812 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 16 treesize of output 11 [2024-11-13 23:12:25,832 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 16 treesize of output 11 [2024-11-13 23:12:25,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:12:25,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:12:25,908 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2024-11-13 23:12:25,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:25,937 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2024-11-13 23:12:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:12:26,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:12:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 72 states and 220 transitions. [2024-11-13 23:12:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 220 transitions. [2024-11-13 23:12:26,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:12:26,339 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:12:26,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:12:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:12:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:12:26,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-13 23:12:26,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:12:26,708 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 14 treesize of output 12 [2024-11-13 23:12:26,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:12:26,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:12:26,740 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-11-13 23:12:26,740 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 1 case distinctions, treesize of input 17 treesize of output 23 [2024-11-13 23:12:26,747 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-13 23:12:26,764 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 16 treesize of output 11 [2024-11-13 23:12:26,775 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 16 treesize of output 11 [2024-11-13 23:12:26,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:12:26,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-13 23:12:26,835 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2024-11-13 23:12:27,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:27,037 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 50 [2024-11-13 23:12:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:12:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:12:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 72 states and 220 transitions. [2024-11-13 23:12:27,563 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 220 transitions. [2024-11-13 23:12:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:12:27,563 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:12:27,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:12:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:12:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:12:27,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 23:12:27,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:12:28,188 INFO L349 Elim1Store]: treesize reduction 210, result has 38.1 percent of original size [2024-11-13 23:12:28,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 356 treesize of output 495 [2024-11-13 23:12:28,231 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 17 treesize of output 15 [2024-11-13 23:12:28,296 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:28,296 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 107 [2024-11-13 23:12:28,385 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:28,386 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 120 [2024-11-13 23:12:28,504 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:28,505 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 110 [2024-11-13 23:12:28,575 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:28,575 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2024-11-13 23:12:28,634 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:28,634 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 156 [2024-11-13 23:12:28,687 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:28,688 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 127 [2024-11-13 23:12:28,758 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:28,758 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 131 [2024-11-13 23:12:28,825 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:28,826 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 117 [2024-11-13 23:12:29,053 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:29,054 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 126 [2024-11-13 23:12:29,233 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:29,233 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 96 [2024-11-13 23:12:29,305 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:29,306 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 118 [2024-11-13 23:12:29,475 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:29,476 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 96 [2024-11-13 23:12:29,644 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 100 treesize of output 94 [2024-11-13 23:12:29,799 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 114 [2024-11-13 23:12:29,866 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 118 [2024-11-13 23:12:30,312 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 183 treesize of output 171 [2024-11-13 23:12:30,595 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:30,599 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 612 [2024-11-13 23:12:31,143 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:31,146 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 707 [2024-11-13 23:12:31,998 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:31,999 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 195 [2024-11-13 23:12:32,270 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:32,271 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 172 [2024-11-13 23:12:32,367 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 2800 treesize of output 2690 [2024-11-13 23:12:33,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:12:33,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:12:33,491 INFO L349 Elim1Store]: treesize reduction 40, result has 25.9 percent of original size [2024-11-13 23:12:33,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 435 treesize of output 388 [2024-11-13 23:12:33,586 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:33,586 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2024-11-13 23:12:33,627 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:33,628 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2024-11-13 23:12:33,665 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 27 treesize of output 6 [2024-11-13 23:12:33,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 45 treesize of output 52 [2024-11-13 23:12:33,743 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-13 23:12:33,892 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:12:33,907 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:12:33,934 INFO L349 Elim1Store]: treesize reduction 24, result has 25.0 percent of original size [2024-11-13 23:12:33,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 595 treesize of output 504 [2024-11-13 23:12:34,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 45 [2024-11-13 23:12:34,209 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-13 23:12:34,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:12:34,244 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:12:34,253 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-13 23:12:34,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 492 treesize of output 427 [2024-11-13 23:12:34,294 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-13 23:12:34,325 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:12:34,339 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:12:34,388 INFO L349 Elim1Store]: treesize reduction 56, result has 24.3 percent of original size [2024-11-13 23:12:34,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 731 treesize of output 693 [2024-11-13 23:12:34,564 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-13 23:12:34,626 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-13 23:12:34,635 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:34,635 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 104 [2024-11-13 23:12:34,641 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:34,641 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 203 [2024-11-13 23:12:34,690 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:34,691 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 148 [2024-11-13 23:12:34,735 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:12:34,735 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 138 [2024-11-13 23:12:34,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:12:34,764 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:12:34,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:12:34,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 66 [2024-11-13 23:12:34,790 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:12:34,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 23:12:35,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-13 23:12:35,325 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2024-11-13 23:12:36,024 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2024-11-13 23:12:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:12:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:12:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 81 states and 261 transitions. [2024-11-13 23:12:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 261 transitions. [2024-11-13 23:12:58,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:12:58,873 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:12:58,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:12:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:12:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:12:58,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-13 23:12:58,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:12:59,033 INFO L349 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2024-11-13 23:12:59,033 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 2 case distinctions, treesize of input 59 treesize of output 33 [2024-11-13 23:12:59,058 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:12:59,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 23:12:59,094 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:12:59,094 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 31 [2024-11-13 23:12:59,158 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-13 23:12:59,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 48 [2024-11-13 23:12:59,221 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-13 23:12:59,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 60 [2024-11-13 23:13:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:13:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:13:00,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 81 states and 261 transitions. [2024-11-13 23:13:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 261 transitions. [2024-11-13 23:13:00,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:13:00,422 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:13:00,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:13:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:13:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:00,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 23:13:00,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:13:00,988 INFO L349 Elim1Store]: treesize reduction 210, result has 38.1 percent of original size [2024-11-13 23:13:00,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 470 treesize of output 547 [2024-11-13 23:13:01,033 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 17 treesize of output 15 [2024-11-13 23:13:01,161 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:01,162 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 135 [2024-11-13 23:13:01,224 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:01,225 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 132 [2024-11-13 23:13:01,272 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:01,272 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 145 [2024-11-13 23:13:01,410 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:01,411 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 117 [2024-11-13 23:13:01,543 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:01,544 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 131 [2024-11-13 23:13:01,625 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 520 treesize of output 478 [2024-11-13 23:13:02,333 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 18 treesize of output 3 [2024-11-13 23:13:02,456 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 18 treesize of output 3 [2024-11-13 23:13:02,879 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:02,880 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 111 [2024-11-13 23:13:02,955 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:02,957 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 402 [2024-11-13 23:13:03,422 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:03,423 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 404 [2024-11-13 23:13:03,936 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:03,938 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 544 [2024-11-13 23:13:04,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:04,525 INFO L349 Elim1Store]: treesize reduction 70, result has 19.5 percent of original size [2024-11-13 23:13:04,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 944 treesize of output 916 [2024-11-13 23:13:05,242 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:13:05,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:05,246 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:13:05,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 327 treesize of output 305 [2024-11-13 23:13:05,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:05,336 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:13:05,341 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:13:05,343 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:13:05,343 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:13:05,344 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:13:05,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 63 treesize of output 41 [2024-11-13 23:13:05,510 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 780 treesize of output 762 [2024-11-13 23:13:05,767 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 3 [2024-11-13 23:13:05,796 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:05,800 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 463 [2024-11-13 23:13:06,273 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:06,273 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2024-11-13 23:13:06,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:06,530 INFO L349 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2024-11-13 23:13:06,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 950 treesize of output 836 [2024-11-13 23:13:06,573 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:06,573 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2024-11-13 23:13:06,622 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:06,622 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2024-11-13 23:13:06,748 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-13 23:13:06,761 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-13 23:13:06,824 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:06,828 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 435 [2024-11-13 23:13:07,520 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 43 treesize of output 40 [2024-11-13 23:13:07,577 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 43 treesize of output 40 [2024-11-13 23:13:07,654 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 84 treesize of output 79 [2024-11-13 23:13:07,790 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 71 treesize of output 67 [2024-11-13 23:13:07,882 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:07,884 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 586 [2024-11-13 23:13:08,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:08,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:08,544 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:13:08,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:13:08,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 22 [2024-11-13 23:13:08,578 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:08,579 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 435 [2024-11-13 23:13:08,725 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 337 treesize of output 325 [2024-11-13 23:13:09,422 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 23:13:09,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 23:13:09,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-13 23:13:09,543 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2024-11-13 23:13:09,629 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 49 [2024-11-13 23:13:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:13:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:13:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 81 states and 261 transitions. [2024-11-13 23:13:10,234 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 261 transitions. [2024-11-13 23:13:10,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:13:10,235 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:13:10,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 23:13:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 23:13:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:10,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-13 23:13:10,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:13:10,846 INFO L349 Elim1Store]: treesize reduction 210, result has 38.1 percent of original size [2024-11-13 23:13:10,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 470 treesize of output 547 [2024-11-13 23:13:10,903 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 17 treesize of output 15 [2024-11-13 23:13:10,956 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:10,957 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 120 [2024-11-13 23:13:11,043 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:11,044 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 107 [2024-11-13 23:13:11,123 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:11,123 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 110 [2024-11-13 23:13:11,219 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:11,219 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 135 [2024-11-13 23:13:11,402 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:11,402 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2024-11-13 23:13:11,503 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:11,504 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2024-11-13 23:13:11,730 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:11,731 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 99 [2024-11-13 23:13:12,133 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 183 treesize of output 171 [2024-11-13 23:13:12,344 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 18 treesize of output 3 [2024-11-13 23:13:12,491 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 183 treesize of output 171 [2024-11-13 23:13:12,565 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 18 treesize of output 3 [2024-11-13 23:13:12,659 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 63 [2024-11-13 23:13:12,753 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-13 23:13:12,757 INFO L158 Benchmark]: Toolchain (without parser) took 223870.61ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 118.6MB in the beginning and 347.8MB in the end (delta: -229.2MB). Peak memory consumption was 381.6MB. Max. memory is 16.1GB. [2024-11-13 23:13:12,758 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 142.6MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:13:12,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.98ms. Allocated memory is still 142.6MB. Free memory was 118.4MB in the beginning and 106.6MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:13:12,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.95ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 105.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 23:13:12,758 INFO L158 Benchmark]: Boogie Preprocessor took 39.84ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 104.3MB in the end (delta: 973.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:13:12,759 INFO L158 Benchmark]: RCFGBuilder took 585.65ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 88.6MB in the end (delta: 15.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 23:13:12,759 INFO L158 Benchmark]: CodeCheck took 222872.39ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 88.6MB in the beginning and 347.8MB in the end (delta: -259.2MB). Peak memory consumption was 356.5MB. Max. memory is 16.1GB. [2024-11-13 23:13:12,760 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.36ms. Allocated memory is still 142.6MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.98ms. Allocated memory is still 142.6MB. Free memory was 118.4MB in the beginning and 106.6MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.95ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 105.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.84ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 104.3MB in the end (delta: 973.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 585.65ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 88.6MB in the end (delta: 15.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * CodeCheck took 222872.39ms. Allocated memory was 142.6MB in the beginning and 755.0MB in the end (delta: 612.4MB). Free memory was 88.6MB in the beginning and 347.8MB in the end (delta: -259.2MB). Peak memory consumption was 356.5MB. Max. memory is 16.1GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-13 23:13:12,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/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_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/config/KojakReach.xml -i ../../sv-benchmarks/c/array-fpi/ncomp.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm --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 c3d1ff002f6e6cf179cc6204a129c133a3beda704ea9fff27ad69a10f5c1f33d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 23:13:15,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 23:13:15,655 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2024-11-13 23:13:15,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 23:13:15,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 23:13:15,687 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2024-11-13 23:13:15,687 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 23:13:15,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 23:13:15,688 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 23:13:15,688 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 23:13:15,688 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 23:13:15,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 23:13:15,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 23:13:15,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 23:13:15,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 23:13:15,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 23:13:15,689 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 23:13:15,689 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 23:13:15,689 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 23:13:15,690 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 23:13:15,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 23:13:15,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 23:13:15,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 23:13:15,691 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2024-11-13 23:13:15,691 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2024-11-13 23:13:15,691 INFO L153 SettingsManager]: * Theory for external solver=ALL [2024-11-13 23:13:15,691 INFO L153 SettingsManager]: * Command for calling external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 23:13:15,691 INFO L153 SettingsManager]: * Choose which separate solver to use for tracechecks=External_ModelsAndUnsatCoreMode [2024-11-13 23:13:15,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 23:13:15,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 23:13:15,692 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 23:13:15,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 23:13:15,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 23:13:15,692 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-13 23:13:15,692 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 23:13:15,692 INFO L153 SettingsManager]: * Use separate solver for trace checks=false [2024-11-13 23:13:15,692 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_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm 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 -> c3d1ff002f6e6cf179cc6204a129c133a3beda704ea9fff27ad69a10f5c1f33d [2024-11-13 23:13:16,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 23:13:16,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 23:13:16,058 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 23:13:16,059 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 23:13:16,060 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 23:13:16,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/../../sv-benchmarks/c/array-fpi/ncomp.c Unable to find full path for "g++" [2024-11-13 23:13:18,066 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 23:13:18,317 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 23:13:18,321 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/sv-benchmarks/c/array-fpi/ncomp.c [2024-11-13 23:13:18,329 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/data/72b5d8c91/553768c579ce4997b81df1022c27581b/FLAGdaeeac81d [2024-11-13 23:13:18,344 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/data/72b5d8c91/553768c579ce4997b81df1022c27581b [2024-11-13 23:13:18,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 23:13:18,349 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 23:13:18,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 23:13:18,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 23:13:18,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 23:13:18,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:13:18" (1/1) ... [2024-11-13 23:13:18,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fde6d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:13:18, skipping insertion in model container [2024-11-13 23:13:18,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 11:13:18" (1/1) ... [2024-11-13 23:13:18,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 23:13:18,561 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_f800add9-785d-432e-bb08-fccae69424bc/sv-benchmarks/c/array-fpi/ncomp.c[588,601] [2024-11-13 23:13:18,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:13:18,624 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 23:13:18,641 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_f800add9-785d-432e-bb08-fccae69424bc/sv-benchmarks/c/array-fpi/ncomp.c[588,601] [2024-11-13 23:13:18,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 23:13:18,696 INFO L204 MainTranslator]: Completed translation [2024-11-13 23:13:18,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:13:18 WrapperNode [2024-11-13 23:13:18,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 23:13:18,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 23:13:18,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 23:13:18,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 23:13:18,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:13:18" (1/1) ... [2024-11-13 23:13:18,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:13:18" (1/1) ... [2024-11-13 23:13:18,753 INFO L138 Inliner]: procedures = 18, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 92 [2024-11-13 23:13:18,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 23:13:18,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 23:13:18,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 23:13:18,755 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 23:13:18,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:13:18" (1/1) ... [2024-11-13 23:13:18,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:13:18" (1/1) ... [2024-11-13 23:13:18,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:13:18" (1/1) ... [2024-11-13 23:13:18,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:13:18" (1/1) ... [2024-11-13 23:13:18,788 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:13:18" (1/1) ... [2024-11-13 23:13:18,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:13:18" (1/1) ... [2024-11-13 23:13:18,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:13:18" (1/1) ... [2024-11-13 23:13:18,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:13:18" (1/1) ... [2024-11-13 23:13:18,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 23:13:18,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 23:13:18,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 23:13:18,805 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 23:13:18,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 11:13:18" (1/1) ... [2024-11-13 23:13:18,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2024-11-13 23:13:18,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/z3 [2024-11-13 23:13:18,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2024-11-13 23:13:18,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2024-11-13 23:13:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 23:13:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-13 23:13:18,887 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2024-11-13 23:13:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-13 23:13:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 23:13:18,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 23:13:18,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2024-11-13 23:13:18,959 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 23:13:18,960 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 23:13:19,485 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-13 23:13:19,485 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 23:13:19,575 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 23:13:19,575 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-13 23:13:19,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:13:19 BoogieIcfgContainer [2024-11-13 23:13:19,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 23:13:19,577 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2024-11-13 23:13:19,577 INFO L270 PluginConnector]: Initializing CodeCheck... [2024-11-13 23:13:19,591 INFO L274 PluginConnector]: CodeCheck initialized [2024-11-13 23:13:19,592 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 11:13:19" (1/1) ... [2024-11-13 23:13:19,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 23:13:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:13:19,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 12 states and 17 transitions. [2024-11-13 23:13:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2024-11-13 23:13:19,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-13 23:13:19,676 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:13:19,677 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:13:19,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:13:19,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:13:19,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-13 23:13:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:20,184 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:13:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:20,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 23:13:20,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:13:20,429 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-13 23:13:20,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:20,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 23:13:20,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:20,522 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 15 treesize of output 19 [2024-11-13 23:13:20,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 49 [2024-11-13 23:13:20,601 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:20,602 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2024-11-13 23:13:20,615 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-13 23:13:20,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 46 treesize of output 54 [2024-11-13 23:13:20,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:20,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2024-11-13 23:13:20,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:20,767 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 15 treesize of output 19 [2024-11-13 23:13:20,807 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 21 treesize of output 15 [2024-11-13 23:13:20,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:20,842 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 15 treesize of output 19 [2024-11-13 23:13:20,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:20,870 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2024-11-13 23:13:21,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:21,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 33 [2024-11-13 23:13:21,437 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-13 23:13:21,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (2)] Ended with exit code 0 [2024-11-13 23:13:22,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:13:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 17 states and 32 transitions. [2024-11-13 23:13:22,346 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 32 transitions. [2024-11-13 23:13:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 23:13:22,350 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:13:22,350 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:13:22,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:13:22,353 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:13:22,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-13 23:13:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:22,665 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:13:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:22,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:13:22,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:13:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:13:23,066 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-13 23:13:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:13:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 18 states and 33 transitions. [2024-11-13 23:13:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2024-11-13 23:13:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 23:13:24,347 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:13:24,347 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:13:24,347 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:13:24,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:13:24,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-13 23:13:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:24,611 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:13:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:24,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:13:24,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:13:24,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:13:24,851 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-13 23:13:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:13:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 19 states and 36 transitions. [2024-11-13 23:13:25,544 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 36 transitions. [2024-11-13 23:13:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-13 23:13:25,545 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:13:25,545 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:13:25,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:13:25,549 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:13:25,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-13 23:13:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:25,812 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:13:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:25,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:13:25,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:13:26,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:13:26,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-13 23:13:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:13:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 20 states and 39 transitions. [2024-11-13 23:13:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 39 transitions. [2024-11-13 23:13:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-13 23:13:26,353 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:13:26,353 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:13:26,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:13:26,355 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:13:26,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-13 23:13:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:26,623 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:13:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:26,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 23:13:26,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:13:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:13:26,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-13 23:13:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:13:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 20 states and 35 transitions. [2024-11-13 23:13:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 35 transitions. [2024-11-13 23:13:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 23:13:27,760 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:13:27,760 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:13:27,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:13:27,762 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:13:27,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-13 23:13:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:28,694 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:13:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:28,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-13 23:13:28,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:13:28,858 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 14 treesize of output 12 [2024-11-13 23:13:28,895 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-13 23:13:28,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 44 treesize of output 52 [2024-11-13 23:13:28,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:28,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 29 [2024-11-13 23:13:28,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:28,965 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 15 treesize of output 19 [2024-11-13 23:13:29,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2024-11-13 23:13:29,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:29,032 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:13:29,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 29 [2024-11-13 23:13:29,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:13:29,076 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 15 treesize of output 19 [2024-11-13 23:13:29,414 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 27 treesize of output 20 [2024-11-13 23:13:30,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-13 23:13:30,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2024-11-13 23:13:31,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 43 [2024-11-13 23:13:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:13:31,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-13 23:13:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:13:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 27 states and 58 transitions. [2024-11-13 23:13:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 58 transitions. [2024-11-13 23:13:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-13 23:13:36,809 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:13:36,809 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:13:36,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:13:36,815 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:13:36,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-13 23:13:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:37,181 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:13:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:37,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 23:13:37,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:13:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:13:37,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-13 23:13:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:13:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 30 states and 63 transitions. [2024-11-13 23:13:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 63 transitions. [2024-11-13 23:13:39,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 23:13:39,878 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:13:39,878 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:13:39,878 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:13:39,881 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:13:39,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-13 23:13:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:40,135 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:13:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:40,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 23:13:40,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:13:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:13:41,168 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-11-13 23:13:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:13:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 33 states and 72 transitions. [2024-11-13 23:13:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 72 transitions. [2024-11-13 23:13:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-13 23:13:45,222 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:13:45,223 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:13:45,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:13:45,225 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:13:45,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-13 23:13:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:45,519 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:13:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:45,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 23:13:45,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:13:46,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:13:46,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-13 23:13:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:13:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 34 states and 73 transitions. [2024-11-13 23:13:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 73 transitions. [2024-11-13 23:13:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-13 23:13:48,994 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:13:48,994 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:13:48,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:13:48,996 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:13:48,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-13 23:13:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:49,280 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:13:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:49,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 23:13:49,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:13:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:13:49,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-11-13 23:13:52,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:13:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 37 states and 78 transitions. [2024-11-13 23:13:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 78 transitions. [2024-11-13 23:13:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:13:52,267 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:13:52,267 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:13:52,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:13:52,269 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:13:52,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-11-13 23:13:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:52,648 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:13:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:52,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 23:13:52,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:13:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 23:13:52,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2024-11-13 23:13:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:13:54,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 34 states and 66 transitions. [2024-11-13 23:13:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 66 transitions. [2024-11-13 23:13:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:13:54,201 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:13:54,201 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:13:54,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:13:54,204 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:13:54,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-11-13 23:13:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:56,030 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:13:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:13:56,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 23:13:56,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:13:56,222 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-13 23:13:56,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2024-11-13 23:13:56,261 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:56,262 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2024-11-13 23:13:56,289 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 46 treesize of output 1 [2024-11-13 23:13:56,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2024-11-13 23:13:56,355 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:56,356 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2024-11-13 23:13:56,384 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 13 treesize of output 1 [2024-11-13 23:13:56,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 44 treesize of output 52 [2024-11-13 23:13:56,446 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:56,447 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2024-11-13 23:13:56,478 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 13 treesize of output 1 [2024-11-13 23:13:56,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2024-11-13 23:13:56,580 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:56,581 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2024-11-13 23:13:56,609 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 13 treesize of output 1 [2024-11-13 23:13:56,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 32 treesize of output 45 [2024-11-13 23:13:56,657 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:13:56,657 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2024-11-13 23:13:56,683 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 13 treesize of output 1 [2024-11-13 23:13:56,788 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 14 treesize of output 12 [2024-11-13 23:14:01,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:14:01,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:14:01,974 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 58 treesize of output 51 [2024-11-13 23:14:01,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:14:01,999 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 15 treesize of output 19 [2024-11-13 23:14:02,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:14:02,110 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 15 treesize of output 19 [2024-11-13 23:14:02,700 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 27 treesize of output 20 [2024-11-13 23:14:03,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-13 23:14:04,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-13 23:14:04,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2024-11-13 23:14:04,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 93 [2024-11-13 23:14:06,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 64 [2024-11-13 23:14:06,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:14:06,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-11-13 23:14:06,346 WARN L851 $PredicateComparison]: unable to prove that (not (and (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32)) (not (bvsle c_~N~0 (_ bv0 32))) (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (let ((.cse4 ((_ sign_extend 32) c_~N~0))) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse1 ((_ extract 31 0) .cse4)) (.cse2 ((_ extract 63 32) .cse4))) (or (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~b~0#1.base| .cse0) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse1) (_ bv4 32) .cse2) .cse3))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse3 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base| .cse0) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse1) (_ bv4 32) .cse2)) (= v_DerPreprocessor_3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base|))))))) (bvule c_~N~0 (_ bv536870911 32)))) is different from false [2024-11-13 23:14:06,367 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ sign_extend 32) c_~N~0))) (let ((.cse0 (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32))) (.cse1 (not (bvsle c_~N~0 (_ bv0 32)))) (.cse2 (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32))) (.cse6 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse5 ((_ extract 31 0) .cse11)) (.cse10 (bvule c_~N~0 (_ bv536870911 32))) (.cse9 ((_ extract 63 32) .cse11)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (and .cse0 .cse1 .cse2 .cse3 (= (select .cse4 (_ bv0 32)) .cse5) .cse6 .cse7 (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (or (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse5) (_ bv4 32) .cse9) .cse4))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse4 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse5) (_ bv4 32) .cse9)) (= v_DerPreprocessor_3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base|)))))) .cse10)) .cse10 (= .cse9 (select .cse4 (_ bv4 32)))))) is different from false [2024-11-13 23:14:06,399 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse11 ((_ sign_extend 32) c_~N~0))) (let ((.cse0 (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32))) (.cse1 (not (bvsle c_~N~0 (_ bv0 32)))) (.cse2 (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32))) (.cse6 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse7 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse5 ((_ extract 31 0) .cse11)) (.cse10 (bvule c_~N~0 (_ bv536870911 32))) (.cse9 ((_ extract 63 32) .cse11)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (and .cse0 .cse1 .cse2 .cse3 (= (select .cse4 (_ bv0 32)) .cse5) .cse6 .cse7 (not (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (or (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse5) (_ bv4 32) .cse9) .cse4))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse4 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse5) (_ bv4 32) .cse9)) (= v_DerPreprocessor_3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base|)))))) .cse10)) .cse10 (= .cse9 (select .cse4 (_ bv4 32))))))) is different from true [2024-11-13 23:14:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:14:23,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 44 states and 97 transitions. [2024-11-13 23:14:23,550 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 97 transitions. [2024-11-13 23:14:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:14:23,551 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:14:23,551 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:14:23,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:14:23,555 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:14:23,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-13 23:14:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:24,988 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:14:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:14:25,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-13 23:14:25,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:14:25,410 INFO L349 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2024-11-13 23:14:25,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 116 [2024-11-13 23:14:25,423 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:14:25,424 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 120 [2024-11-13 23:14:25,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:14:25,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 176 treesize of output 140 [2024-11-13 23:14:25,492 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:14:25,493 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 108 [2024-11-13 23:14:26,806 INFO L349 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2024-11-13 23:14:26,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 116 [2024-11-13 23:14:26,817 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:14:26,817 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 95 [2024-11-13 23:14:26,824 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:14:26,825 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 211 [2024-11-13 23:14:26,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:14:26,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 69 treesize of output 92 [2024-11-13 23:14:28,126 INFO L349 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2024-11-13 23:14:28,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 116 [2024-11-13 23:14:28,136 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:14:28,137 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 90 [2024-11-13 23:14:28,148 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:14:28,149 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 204 [2024-11-13 23:14:28,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:14:28,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 176 treesize of output 140 [2024-11-13 23:14:29,170 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 23:14:29,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 23:14:30,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:14:30,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:14:30,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:14:30,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-13 23:14:30,349 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 11 treesize of output 15 [2024-11-13 23:14:30,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:14:30,416 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 15 treesize of output 19 [2024-11-13 23:14:31,943 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-13 23:14:31,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 73 [2024-11-13 23:14:33,445 INFO L349 Elim1Store]: treesize reduction 40, result has 14.9 percent of original size [2024-11-13 23:14:33,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 99 treesize of output 104 [2024-11-13 23:14:36,836 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-13 23:14:36,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 8 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 137 treesize of output 81 [2024-11-13 23:14:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:14:36,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-11-13 23:15:02,468 WARN L286 SmtUtils]: Spent 24.63s on a formula simplification. DAG size of input: 105 DAG size of output: 98 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:15:12,114 WARN L286 SmtUtils]: Spent 7.76s on a formula simplification. DAG size of input: 107 DAG size of output: 101 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:15:12,132 WARN L851 $PredicateComparison]: unable to prove that (not (let ((.cse6 ((_ sign_extend 32) c_~N~0))) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 ((_ extract 31 0) .cse6)) (.cse4 ((_ extract 63 32) .cse6))) (and (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32)) (not (bvsle c_~N~0 (_ bv0 32))) (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_27) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_28))) (let ((.cse2 (store (store (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~b~0#1.base|) (_ bv0 32) (_ bv1 32)) (_ bv4 32) (_ bv0 32)))) (and (= v_DerPreprocessor_27 (select (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse1 .cse2) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse3) (_ bv4 32) .cse4) .cse5))))) (= v_DerPreprocessor_29 (store (store v_arrayElimArr_18 (_ bv0 32) (select v_DerPreprocessor_29 (_ bv0 32))) (_ bv4 32) (select v_DerPreprocessor_29 (_ bv4 32)))))) (= (_ bv6 32) (select v_arrayElimArr_18 (_ bv0 32))) (= (_ bv0 32) (select v_arrayElimArr_18 (_ bv4 32))))) (or (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse3) (_ bv4 32) .cse4) .cse5)) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse5 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse3) (_ bv4 32) .cse4)) (= v_DerPreprocessor_3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base|))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (bvule c_~N~0 (_ bv536870911 32)))))) is different from false [2024-11-13 23:15:24,142 WARN L286 SmtUtils]: Spent 10.92s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:15:34,225 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-13 23:16:32,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:16:32,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 54 states and 127 transitions. [2024-11-13 23:16:32,990 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 127 transitions. [2024-11-13 23:16:32,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:16:32,990 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:16:32,990 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:16:32,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:16:32,993 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:16:32,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-13 23:16:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:16:34,763 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:16:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:16:34,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 23:16:34,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:16:35,432 INFO L349 Elim1Store]: treesize reduction 15, result has 53.1 percent of original size [2024-11-13 23:16:35,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 49 [2024-11-13 23:16:35,495 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-13 23:16:35,495 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 27 [2024-11-13 23:16:35,529 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 11 treesize of output 15 [2024-11-13 23:16:35,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:16:36,036 INFO L349 Elim1Store]: treesize reduction 15, result has 53.1 percent of original size [2024-11-13 23:16:36,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 49 [2024-11-13 23:16:36,121 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:16:36,338 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-13 23:16:36,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 35 [2024-11-13 23:16:36,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:16:36,379 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2024-11-13 23:16:36,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2024-11-13 23:16:36,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:16:36,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2024-11-13 23:16:36,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:16:36,754 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 23:16:36,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 25 [2024-11-13 23:16:36,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:16:36,898 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 13 treesize of output 17 [2024-11-13 23:16:37,082 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 23:16:37,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 23:16:39,324 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 23 treesize of output 16 [2024-11-13 23:16:44,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2024-11-13 23:16:48,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 94 [2024-11-13 23:16:58,646 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-13 23:16:58,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 8 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 137 treesize of output 81 [2024-11-13 23:16:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:16:58,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2024-11-13 23:16:58,795 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ sign_extend 32) c_~N~0))) (let ((.cse0 (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32))) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse5 ((_ extract 31 0) .cse8)) (.cse6 ((_ extract 63 32) .cse8))) (and (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32)) (not (bvsle c_~N~0 (_ bv0 32))) (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32)) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_27) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_28))) (let ((.cse4 (store (store (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~b~0#1.base|) (_ bv0 32) (_ bv1 32)) (_ bv4 32) (_ bv0 32)))) (and (= v_DerPreprocessor_27 (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse3 .cse4) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse5) (_ bv4 32) .cse6) .cse7))))) (= v_DerPreprocessor_29 (store (store v_arrayElimArr_18 (_ bv0 32) (select v_DerPreprocessor_29 (_ bv0 32))) (_ bv4 32) (select v_DerPreprocessor_29 (_ bv4 32)))))) (= (_ bv6 32) (select v_arrayElimArr_18 (_ bv0 32))) (= (_ bv0 32) (select v_arrayElimArr_18 (_ bv4 32))))))) .cse0 (= (_ bv1 32) (select .cse3 (_ bv0 32))) .cse1 (= (_ bv0 32) (select .cse3 (_ bv4 32))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (or (and .cse1 (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse5) (_ bv4 32) .cse6) .cse7))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse7 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse5) (_ bv4 32) .cse6)) (= v_DerPreprocessor_3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base|))))) (bvule c_~N~0 (_ bv536870911 32))))) is different from false [2024-11-13 23:17:05,092 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse8 ((_ sign_extend 32) c_~N~0))) (let ((.cse0 (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32))) (.cse1 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse5 ((_ extract 31 0) .cse8)) (.cse6 ((_ extract 63 32) .cse8))) (and (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32)) (not (bvsle c_~N~0 (_ bv0 32))) (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32)) (not (and .cse0 .cse1 (exists ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32)))) (and (exists ((v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_27) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_28))) (let ((.cse4 (store (store (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_main_~b~0#1.base|) (_ bv0 32) (_ bv1 32)) (_ bv4 32) (_ bv0 32)))) (and (= v_DerPreprocessor_27 (select (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~b~0#1.base|)) (= .cse3 .cse4) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_28) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse5) (_ bv4 32) .cse6) .cse7))))) (= v_DerPreprocessor_29 (store (store v_arrayElimArr_18 (_ bv0 32) (select v_DerPreprocessor_29 (_ bv0 32))) (_ bv4 32) (select v_DerPreprocessor_29 (_ bv4 32)))))) (= (_ bv6 32) (select v_arrayElimArr_18 (_ bv0 32))) (= (_ bv0 32) (select v_arrayElimArr_18 (_ bv4 32))))))) .cse0 (= (_ bv1 32) (select .cse3 (_ bv0 32))) .cse1 (= (_ bv0 32) (select .cse3 (_ bv4 32))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (or (and .cse1 (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse5) (_ bv4 32) .cse6) .cse7))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse7 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse5) (_ bv4 32) .cse6)) (= v_DerPreprocessor_3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base|))))) (bvule c_~N~0 (_ bv536870911 32)))))) is different from true [2024-11-13 23:17:24,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:17:24,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 55 states and 130 transitions. [2024-11-13 23:17:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 130 transitions. [2024-11-13 23:17:24,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:17:24,725 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:17:24,725 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:17:24,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:17:24,729 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:17:24,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-13 23:17:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:17:26,469 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:17:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:17:26,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 23:17:26,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:17:26,754 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 23:17:26,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 23:17:26,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 39 treesize of output 47 [2024-11-13 23:17:26,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 25 [2024-11-13 23:17:26,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:17:26,949 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 13 treesize of output 17 [2024-11-13 23:17:28,947 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 23 treesize of output 16 [2024-11-13 23:17:29,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2024-11-13 23:17:30,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 94 [2024-11-13 23:17:34,474 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-13 23:17:34,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 8 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 137 treesize of output 81 [2024-11-13 23:17:34,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:17:34,541 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2024-11-13 23:17:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:17:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 55 states and 130 transitions. [2024-11-13 23:17:34,637 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 130 transitions. [2024-11-13 23:17:34,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:17:34,638 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:17:34,638 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:17:34,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:17:34,641 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:17:34,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-13 23:17:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:17:36,142 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:17:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:17:36,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-13 23:17:36,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:17:36,449 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 14 treesize of output 12 [2024-11-13 23:17:36,534 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-13 23:17:36,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2024-11-13 23:17:36,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:17:36,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 29 [2024-11-13 23:17:36,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:17:36,727 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 15 treesize of output 19 [2024-11-13 23:17:36,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 44 treesize of output 52 [2024-11-13 23:17:36,905 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:17:36,906 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2024-11-13 23:17:36,970 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 13 treesize of output 1 [2024-11-13 23:19:49,915 WARN L286 SmtUtils]: Spent 1.68m on a formula simplification. DAG size of input: 45 DAG size of output: 43 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:19:50,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:19:50,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:19:50,256 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 47 treesize of output 38 [2024-11-13 23:19:50,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:19:50,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 15 treesize of output 19 [2024-11-13 23:19:53,377 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 27 treesize of output 20 [2024-11-13 23:19:57,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-13 23:19:58,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-13 23:20:00,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:20:00,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 55 [2024-11-13 23:20:03,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:20:03,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 101 [2024-11-13 23:20:28,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:20:28,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 57 [2024-11-13 23:20:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-13 23:20:28,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2024-11-13 23:20:28,332 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 ((_ sign_extend 32) c_~N~0))) (let ((.cse8 ((_ extract 63 32) .cse14)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse7 ((_ extract 31 0) .cse14))) (let ((.cse4 (= (select .cse5 (_ bv0 32)) .cse7)) (.cse0 (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32))) (.cse1 (not (bvsle c_~N~0 (_ bv0 32)))) (.cse2 (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32))) (.cse11 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse12 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (bvule c_~N~0 (_ bv536870911 32))) (.cse10 (= .cse8 (select .cse5 (_ bv4 32))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (exists ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse5 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8))) (and .cse4 .cse9 .cse10)) .cse11 .cse12 (not (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 (or (and (not .cse9) (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8) .cse5))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse5 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8)) (= v_DerPreprocessor_3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base|))))) .cse13)) .cse13 .cse10)))) is different from false [2024-11-13 23:20:28,360 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse14 ((_ sign_extend 32) c_~N~0))) (let ((.cse8 ((_ extract 63 32) .cse14)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse7 ((_ extract 31 0) .cse14))) (let ((.cse4 (= (select .cse5 (_ bv0 32)) .cse7)) (.cse0 (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32))) (.cse1 (not (bvsle c_~N~0 (_ bv0 32)))) (.cse2 (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32))) (.cse11 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse12 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (bvule c_~N~0 (_ bv536870911 32))) (.cse10 (= .cse8 (select .cse5 (_ bv4 32))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (exists ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse5 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8))) (and .cse4 .cse9 .cse10)) .cse11 .cse12 (not (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 (or (and (not .cse9) (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8) .cse5))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse5 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8)) (= v_DerPreprocessor_3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base|))))) .cse13)) .cse13 .cse10)))) is different from true [2024-11-13 23:20:28,386 WARN L851 $PredicateComparison]: unable to prove that (not (and (not (bvsle c_~N~0 (_ bv0 32))) (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32)) (let ((.cse3 ((_ sign_extend 32) c_~N~0))) (let ((.cse1 ((_ extract 31 0) .cse3)) (.cse2 ((_ extract 63 32) .cse3)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|))) (or (exists ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse0 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~b~0#1.base| (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse1) (_ bv4 32) .cse2))) (and (= (select .cse0 (_ bv0 32)) .cse1) (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= .cse2 (select .cse0 (_ bv4 32))))))) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (bvule c_~N~0 (_ bv536870911 32)))) is different from false [2024-11-13 23:20:28,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 ((_ sign_extend 32) c_~N~0))) (let ((.cse8 ((_ extract 63 32) .cse14)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse7 ((_ extract 31 0) .cse14))) (let ((.cse4 (= (select .cse5 (_ bv0 32)) .cse7)) (.cse0 (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32))) (.cse1 (not (bvsle c_~N~0 (_ bv0 32)))) (.cse2 (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32))) (.cse11 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse12 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (bvule c_~N~0 (_ bv536870911 32))) (.cse10 (= .cse8 (select .cse5 (_ bv4 32))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (and .cse1 .cse2 .cse3 (or (exists ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse5 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8))) (and .cse4 .cse9 .cse10)) .cse11 .cse12 .cse13)) .cse11 .cse12 (not (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 (or (and (not .cse9) (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8) .cse5))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse5 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8)) (= v_DerPreprocessor_3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base|))))) .cse13)) .cse13 .cse10)))) is different from false [2024-11-13 23:20:28,501 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse14 ((_ sign_extend 32) c_~N~0))) (let ((.cse8 ((_ extract 63 32) .cse14)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse7 ((_ extract 31 0) .cse14))) (let ((.cse4 (= (select .cse5 (_ bv0 32)) .cse7)) (.cse0 (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32))) (.cse1 (not (bvsle c_~N~0 (_ bv0 32)))) (.cse2 (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32))) (.cse11 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse12 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (bvule c_~N~0 (_ bv536870911 32))) (.cse10 (= .cse8 (select .cse5 (_ bv4 32))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (exists ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse5 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8))) (and .cse4 .cse9 .cse10)) .cse11 .cse12 (not (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 (or (and (not .cse9) (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8) .cse5))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse5 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8)) (= v_DerPreprocessor_3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base|))))) .cse13)) .cse13 .cse10))))) is different from true [2024-11-13 23:20:28,558 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse14 ((_ sign_extend 32) c_~N~0))) (let ((.cse8 ((_ extract 63 32) .cse14)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse7 ((_ extract 31 0) .cse14))) (let ((.cse4 (= (select .cse5 (_ bv0 32)) .cse7)) (.cse0 (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32))) (.cse1 (not (bvsle c_~N~0 (_ bv0 32)))) (.cse2 (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32))) (.cse11 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse12 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse9 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse13 (bvule c_~N~0 (_ bv536870911 32))) (.cse10 (= .cse8 (select .cse5 (_ bv4 32))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (and .cse1 .cse2 .cse3 (or (exists ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse5 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8))) (and .cse4 .cse9 .cse10)) .cse11 .cse12 .cse13)) .cse11 .cse12 (not (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 (or (and (not .cse9) (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8) .cse5))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse5 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base| .cse6) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse7) (_ bv4 32) .cse8)) (= v_DerPreprocessor_3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base|))))) .cse13)) .cse13 .cse10))))) is different from true [2024-11-13 23:21:27,522 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 [] [2024-11-13 23:21:31,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-13 23:21:58,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 10.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-13 23:22:19,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:22:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 64 states and 169 transitions. [2024-11-13 23:22:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 169 transitions. [2024-11-13 23:22:19,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:22:19,240 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:22:19,240 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:22:19,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:22:19,244 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:22:19,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-11-13 23:22:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:22:20,711 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:22:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:22:20,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-13 23:22:20,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:22:20,966 WARN L560 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2024-11-13 23:22:21,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 32 treesize of output 45 [2024-11-13 23:22:21,055 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:22:21,055 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2024-11-13 23:22:21,113 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 13 treesize of output 1 [2024-11-13 23:22:21,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 45 [2024-11-13 23:22:21,248 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:22:21,248 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2024-11-13 23:22:21,308 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 13 treesize of output 1 [2024-11-13 23:22:21,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2024-11-13 23:22:21,448 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:22:21,448 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2024-11-13 23:22:21,509 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 46 treesize of output 1 [2024-11-13 23:22:21,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 44 treesize of output 52 [2024-11-13 23:22:21,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:22:21,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 29 [2024-11-13 23:22:21,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:22:21,794 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 15 treesize of output 19 [2024-11-13 23:22:21,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2024-11-13 23:22:21,957 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:22:21,958 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2024-11-13 23:22:22,059 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 13 treesize of output 1 [2024-11-13 23:22:22,284 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 14 treesize of output 12 [2024-11-13 23:23:15,787 WARN L286 SmtUtils]: Spent 41.06s on a formula simplification. DAG size of input: 54 DAG size of output: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 23:23:15,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:23:15,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:23:15,961 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 61 treesize of output 52 [2024-11-13 23:23:16,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:23:16,084 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 15 treesize of output 19 [2024-11-13 23:23:16,499 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 27 treesize of output 20 [2024-11-13 23:23:16,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-13 23:23:17,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-13 23:23:17,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2024-11-13 23:23:19,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 16 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 93 [2024-11-13 23:23:21,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 64 [2024-11-13 23:23:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 23:23:21,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2024-11-13 23:23:21,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 ((_ sign_extend 32) c_~N~0))) (let ((.cse10 ((_ extract 63 32) .cse15)) (.cse11 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse9 ((_ extract 31 0) .cse15))) (let ((.cse4 (= (select .cse7 (_ bv0 32)) .cse9)) (.cse0 (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32))) (.cse1 (not (bvsle c_~N~0 (_ bv0 32)))) (.cse2 (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32))) (.cse12 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse13 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse5 (not .cse11)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse14 (bvule c_~N~0 (_ bv536870911 32))) (.cse6 (= .cse10 (select .cse7 (_ bv4 32))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (and .cse4 .cse5 .cse6) (exists ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse7 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_39) |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse9) (_ bv4 32) .cse10)) (= v_DerPreprocessor_37 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_39) |c_ULTIMATE.start_main_~b~0#1.base|))))) (not (and .cse1 .cse2 .cse3 (or (exists ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse7 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse9) (_ bv4 32) .cse10))) (and .cse4 .cse11 .cse6)) .cse12 .cse13 .cse14)) .cse12 .cse13 (not (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 (or (and .cse5 (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse9) (_ bv4 32) .cse10) .cse7))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse7 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse9) (_ bv4 32) .cse10)) (= v_DerPreprocessor_3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base|))))) .cse14)) .cse14 .cse6)))) is different from false [2024-11-13 23:23:24,895 WARN L873 $PredicateComparison]: unable to prove that (not (let ((.cse15 ((_ sign_extend 32) c_~N~0))) (let ((.cse10 ((_ extract 63 32) .cse15)) (.cse11 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse9 ((_ extract 31 0) .cse15))) (let ((.cse4 (= (select .cse7 (_ bv0 32)) .cse9)) (.cse0 (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32))) (.cse1 (not (bvsle c_~N~0 (_ bv0 32)))) (.cse2 (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|)) (.cse3 (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32))) (.cse12 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse13 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse5 (not .cse11)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse14 (bvule c_~N~0 (_ bv536870911 32))) (.cse6 (= .cse10 (select .cse7 (_ bv4 32))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (or (and .cse4 .cse5 .cse6) (exists ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse7 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_39) |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse9) (_ bv4 32) .cse10)) (= v_DerPreprocessor_37 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_39) |c_ULTIMATE.start_main_~b~0#1.base|))))) (not (and .cse1 .cse2 .cse3 (or (exists ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse7 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse9) (_ bv4 32) .cse10))) (and .cse4 .cse11 .cse6)) .cse12 .cse13 .cse14)) .cse12 .cse13 (not (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 (or (and .cse5 (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse9) (_ bv4 32) .cse10) .cse7))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse7 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base| .cse8) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse9) (_ bv4 32) .cse10)) (= v_DerPreprocessor_3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base|))))) .cse14)) .cse14 .cse6))))) is different from true [2024-11-13 23:23:25,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2024-11-13 23:23:25,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 64 states and 169 transitions. [2024-11-13 23:23:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 169 transitions. [2024-11-13 23:23:25,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-13 23:23:25,375 INFO L420 CodeCheckObserver]: Error Path is FOUND. [2024-11-13 23:23:25,375 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-13 23:23:25,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 [2024-11-13 23:23:25,379 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-13 23:23:25,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-13 23:23:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:23:26,893 ERROR L567 CodeCheckObserver]: First Tracecheck threw exception Proofs are not supported [2024-11-13 23:23:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 23:23:27,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-13 23:23:27,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 23:23:27,228 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-13 23:23:27,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-13 23:23:27,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 39 treesize of output 47 [2024-11-13 23:23:27,514 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 23:23:27,515 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2024-11-13 23:23:27,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:23:27,594 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2024-11-13 23:23:41,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:23:41,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:23:41,305 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 22 treesize of output 17 [2024-11-13 23:23:41,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 23:23:41,377 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 13 treesize of output 17 [2024-11-13 23:23:44,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2024-11-13 23:23:45,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 94 [2024-11-13 23:23:49,720 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-13 23:23:49,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 8 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 12 case distinctions, treesize of input 137 treesize of output 81 [2024-11-13 23:23:49,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 23:23:49,805 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f800add9-785d-432e-bb08-fccae69424bc/bin/ukojak-verify-EEHR8qb7sm/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-13 23:23:49,898 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 ((_ sign_extend 32) c_~N~0))) (let ((.cse10 ((_ extract 63 32) .cse15)) (.cse11 (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|)) (.cse9 ((_ extract 31 0) .cse15))) (let ((.cse5 (= (select .cse8 (_ bv0 32)) .cse9)) (.cse0 (= |c_ULTIMATE.start_main_~b~0#1.offset| (_ bv0 32))) (.cse2 (not (bvsle c_~N~0 (_ bv0 32)))) (.cse3 (= (_ bv1 64) |c_ULTIMATE.start_main_~i~0#1|)) (.cse4 (= |c_ULTIMATE.start_main_~c~0#1.offset| (_ bv0 32))) (.cse12 (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse13 (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) (.cse6 (not .cse11)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse14 (bvule c_~N~0 (_ bv536870911 32))) (.cse7 (= .cse10 (select .cse8 (_ bv4 32))))) (and .cse0 (exists ((v_DerPreprocessor_44 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_33 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_43 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= (select v_arrayElimArr_33 (_ bv4 32)) ((_ extract 63 32) (_ bv6 64))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_33) |c_ULTIMATE.start_main_~b~0#1.base|) (_ bv0 32) ((_ extract 31 0) (_ bv1 64))) (_ bv4 32) ((_ extract 63 32) (_ bv1 64))) .cse1) (= (select v_arrayElimArr_33 (_ bv0 32)) ((_ extract 31 0) (_ bv6 64))))) .cse2 .cse3 .cse4 (= |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)) .cse5 .cse6 (or (and .cse5 .cse6 .cse7) (exists ((v_DerPreprocessor_38 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_37 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_39 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse8 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_39) |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse9) (_ bv4 32) .cse10)) (= v_DerPreprocessor_37 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_39) |c_ULTIMATE.start_main_~b~0#1.base|))))) (not (and .cse2 .cse3 .cse4 (or (exists ((v_DerPreprocessor_32 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (= .cse8 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_31) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_32) |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse9) (_ bv4 32) .cse10))) (and .cse5 .cse11 .cse7)) .cse12 .cse13 .cse14)) .cse12 .cse13 (not (and .cse0 .cse2 .cse3 .cse4 .cse12 .cse13 (or (and .cse6 (exists ((v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_11) |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse9) (_ bv4 32) .cse10) .cse8))) (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (and (= .cse8 (store (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~c~0#1.base|) (_ bv0 32) .cse9) (_ bv4 32) .cse10)) (= v_DerPreprocessor_3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_main_~b~0#1.base|))))) .cse14)) .cse14 .cse7)))) is different from false