./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-patterns/array8_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV/config/KojakReach.xml -i ../../sv-benchmarks/c/array-patterns/array8_pattern.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV --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 06625eaf591a62e295090a882d83c1e11aaafca7ac8895e7d4adcf51d5b26e02 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-11 23:56:47,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-11 23:56:47,747 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV/config/svcomp-Reach-32bit-Kojak_Default.epf [2023-11-11 23:56:47,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-11 23:56:47,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.Interpolating solver [2023-11-11 23:56:47,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-11 23:56:47,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-11 23:56:47,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2023-11-11 23:56:47,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-11 23:56:47,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-11 23:56:47,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-11 23:56:47,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-11 23:56:47,784 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-11 23:56:47,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-11 23:56:47,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-11 23:56:47,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-11 23:56:47,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-11 23:56:47,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-11 23:56:47,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-11 23:56:47,788 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-11 23:56:47,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-11 23:56:47,789 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-11 23:56:47,790 INFO L151 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2023-11-11 23:56:47,790 INFO L153 SettingsManager]: * Timeout in seconds=1000000 [2023-11-11 23:56:47,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-11 23:56:47,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-11-11 23:56:47,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-11 23:56:47,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-11 23:56:47,793 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-11 23:56:47,794 INFO L153 SettingsManager]: * Trace refinement strategy=PENGUIN [2023-11-11 23:56:47,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-11 23:56:47,794 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-11 23:56:47,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV 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 -> 06625eaf591a62e295090a882d83c1e11aaafca7ac8895e7d4adcf51d5b26e02 [2023-11-11 23:56:48,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-11 23:56:48,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-11 23:56:48,097 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-11 23:56:48,099 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-11 23:56:48,100 INFO L274 PluginConnector]: CDTParser initialized [2023-11-11 23:56:48,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV/../../sv-benchmarks/c/array-patterns/array8_pattern.c [2023-11-11 23:56:51,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-11 23:56:51,587 INFO L384 CDTParser]: Found 1 translation units. [2023-11-11 23:56:51,588 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/sv-benchmarks/c/array-patterns/array8_pattern.c [2023-11-11 23:56:51,601 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV/data/b60ac5c52/17fa6b4daecb47b2bffed37a3e9b492a/FLAG3410101c5 [2023-11-11 23:56:51,622 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV/data/b60ac5c52/17fa6b4daecb47b2bffed37a3e9b492a [2023-11-11 23:56:51,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-11 23:56:51,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-11 23:56:51,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-11 23:56:51,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-11 23:56:51,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-11 23:56:51,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:56:51" (1/1) ... [2023-11-11 23:56:51,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e793098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:51, skipping insertion in model container [2023-11-11 23:56:51,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 11:56:51" (1/1) ... [2023-11-11 23:56:51,684 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-11 23:56:51,875 WARN L240 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_70ec2cce-d073-499b-b3a2-a8ed26567741/sv-benchmarks/c/array-patterns/array8_pattern.c[1321,1334] [2023-11-11 23:56:51,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-11 23:56:51,923 INFO L202 MainTranslator]: Completed pre-run [2023-11-11 23:56:51,941 WARN L240 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_70ec2cce-d073-499b-b3a2-a8ed26567741/sv-benchmarks/c/array-patterns/array8_pattern.c[1321,1334] [2023-11-11 23:56:51,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-11 23:56:51,977 INFO L206 MainTranslator]: Completed translation [2023-11-11 23:56:51,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:51 WrapperNode [2023-11-11 23:56:51,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-11 23:56:51,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-11 23:56:51,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-11 23:56:51,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-11 23:56:51,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:51" (1/1) ... [2023-11-11 23:56:51,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:51" (1/1) ... [2023-11-11 23:56:52,028 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2023-11-11 23:56:52,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-11 23:56:52,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-11 23:56:52,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-11 23:56:52,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-11 23:56:52,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:51" (1/1) ... [2023-11-11 23:56:52,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:51" (1/1) ... [2023-11-11 23:56:52,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:51" (1/1) ... [2023-11-11 23:56:52,043 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:51" (1/1) ... [2023-11-11 23:56:52,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:51" (1/1) ... [2023-11-11 23:56:52,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:51" (1/1) ... [2023-11-11 23:56:52,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:51" (1/1) ... [2023-11-11 23:56:52,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:51" (1/1) ... [2023-11-11 23:56:52,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-11 23:56:52,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-11 23:56:52,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-11 23:56:52,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-11 23:56:52,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 11:56:51" (1/1) ... [2023-11-11 23:56:52,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2023-11-11 23:56:52,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV/z3 [2023-11-11 23:56:52,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) [2023-11-11 23:56:52,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_70ec2cce-d073-499b-b3a2-a8ed26567741/bin/ukojak-verify-0OAaufAVZV/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (1)] Waiting until timeout for monitored process [2023-11-11 23:56:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-11 23:56:52,137 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-11 23:56:52,138 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-11 23:56:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-11 23:56:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-11 23:56:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-11 23:56:52,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-11 23:56:52,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-11 23:56:52,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-11 23:56:52,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-11 23:56:52,216 INFO L236 CfgBuilder]: Building ICFG [2023-11-11 23:56:52,218 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-11 23:56:52,455 INFO L277 CfgBuilder]: Performing block encoding [2023-11-11 23:56:52,515 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-11 23:56:52,515 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-11 23:56:52,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:56:52 BoogieIcfgContainer [2023-11-11 23:56:52,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-11 23:56:52,519 INFO L112 PluginConnector]: ------------------------CodeCheck---------------------------- [2023-11-11 23:56:52,519 INFO L270 PluginConnector]: Initializing CodeCheck... [2023-11-11 23:56:52,530 INFO L274 PluginConnector]: CodeCheck initialized [2023-11-11 23:56:52,531 INFO L184 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 11:56:52" (1/1) ... [2023-11-11 23:56:52,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-11 23:56:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-11 23:56:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 17 states and 22 transitions. [2023-11-11 23:56:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2023-11-11 23:56:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-11 23:56:52,608 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-11 23:56:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-11 23:56:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-11 23:56:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-11 23:56:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-11 23:56:52,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 17 states and 20 transitions. [2023-11-11 23:56:52,806 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2023-11-11 23:56:52,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-11 23:56:52,807 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-11 23:56:52,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-11 23:56:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-11 23:56:52,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-11 23:56:52,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-11 23:56:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-11 23:56:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-11 23:56:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 18 states and 22 transitions. [2023-11-11 23:56:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-11-11 23:56:53,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-11 23:56:53,163 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-11 23:56:53,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-11 23:56:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-11 23:56:53,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-11 23:56:53,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-11 23:56:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-11 23:56:53,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-11 23:56:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 19 states and 23 transitions. [2023-11-11 23:56:53,638 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-11-11 23:56:53,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-11 23:56:53,640 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-11 23:56:53,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-11 23:56:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-11 23:56:53,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-11 23:56:53,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-11 23:56:53,875 INFO L351 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 10 treesize of output 8 [2023-11-11 23:56:53,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:56:53,984 INFO L351 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 14 treesize of output 14 [2023-11-11 23:56:53,991 INFO L351 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 [2023-11-11 23:56:54,500 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-11 23:56:54,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:56:54,514 INFO L351 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 11 [2023-11-11 23:56:54,749 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-11 23:56:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-11 23:56:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-11 23:56:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 28 states and 42 transitions. [2023-11-11 23:56:56,423 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2023-11-11 23:56:56,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-11 23:56:56,425 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-11 23:56:56,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-11 23:56:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-11 23:56:56,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-11 23:56:56,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-11 23:56:56,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-11 23:56:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-11 23:56:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 35 states and 51 transitions. [2023-11-11 23:56:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2023-11-11 23:56:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-11 23:56:58,150 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-11 23:56:58,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-11 23:56:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-11 23:56:58,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-11 23:56:58,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-11 23:56:58,280 INFO L351 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 10 treesize of output 8 [2023-11-11 23:56:58,328 INFO L351 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 27 treesize of output 15 [2023-11-11 23:56:58,456 INFO L351 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 42 treesize of output 35 [2023-11-11 23:56:59,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:56:59,497 INFO L322 Elim1Store]: treesize reduction 72, result has 40.5 percent of original size [2023-11-11 23:56:59,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 110 [2023-11-11 23:57:00,921 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-11 23:57:00,922 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 132 treesize of output 120 [2023-11-11 23:57:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-11 23:57:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-11 23:57:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 43 states and 69 transitions. [2023-11-11 23:57:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 69 transitions. [2023-11-11 23:57:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-11 23:57:05,914 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-11 23:57:05,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-11 23:57:05,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-11 23:57:05,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-11 23:57:05,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-11 23:57:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-11 23:57:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-11 23:57:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 52 states and 86 transitions. [2023-11-11 23:57:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 86 transitions. [2023-11-11 23:57:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-11 23:57:11,212 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-11 23:57:11,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-11 23:57:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-11 23:57:11,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-11 23:57:11,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-11 23:57:11,341 INFO L351 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 10 treesize of output 8 [2023-11-11 23:57:11,370 INFO L351 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 27 treesize of output 15 [2023-11-11 23:57:11,405 INFO L351 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 42 treesize of output 35 [2023-11-11 23:57:11,594 INFO L351 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 56 treesize of output 55 [2023-11-11 23:57:12,654 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-11 23:57:12,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:12,805 INFO L322 Elim1Store]: treesize reduction 132, result has 33.7 percent of original size [2023-11-11 23:57:12,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 4 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 140 treesize of output 125 [2023-11-11 23:57:14,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 52 [2023-11-11 23:57:14,351 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-11 23:57:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-11 23:57:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 60 states and 102 transitions. [2023-11-11 23:57:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 102 transitions. [2023-11-11 23:57:24,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-11 23:57:24,174 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-11 23:57:24,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-11 23:57:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-11 23:57:24,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-11 23:57:24,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-11 23:57:24,274 INFO L351 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 10 treesize of output 8 [2023-11-11 23:57:24,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:24,456 INFO L351 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 14 treesize of output 14 [2023-11-11 23:57:24,460 INFO L351 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 [2023-11-11 23:57:25,043 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-11 23:57:25,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:25,052 INFO L351 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2023-11-11 23:57:25,058 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-11 23:57:25,060 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2023-11-11 23:57:25,069 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-11 23:57:26,042 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-11 23:57:26,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:26,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:26,111 INFO L322 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2023-11-11 23:57:26,111 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 70 [2023-11-11 23:57:26,159 INFO L322 Elim1Store]: treesize reduction 36, result has 12.2 percent of original size [2023-11-11 23:57:26,160 INFO L351 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 3 case distinctions, treesize of input 48 treesize of output 47 [2023-11-11 23:57:26,169 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2023-11-11 23:57:26,183 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-11 23:57:26,222 INFO L322 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-11 23:57:26,223 INFO L351 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 1 case distinctions, treesize of input 18 treesize of output 15 [2023-11-11 23:57:26,242 INFO L351 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 [2023-11-11 23:57:26,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-11 23:57:26,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-11 23:57:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-11 23:57:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 67 states and 120 transitions. [2023-11-11 23:57:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 120 transitions. [2023-11-11 23:57:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-11 23:57:32,018 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-11 23:57:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-11 23:57:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-11 23:57:32,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-11 23:57:32,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-11 23:57:32,123 INFO L351 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 10 treesize of output 8 [2023-11-11 23:57:32,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:32,146 INFO L351 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 14 treesize of output 14 [2023-11-11 23:57:32,156 INFO L351 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 [2023-11-11 23:57:32,491 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-11 23:57:32,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:32,498 INFO L351 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2023-11-11 23:57:32,504 INFO L351 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 [2023-11-11 23:57:32,510 INFO L351 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 38 treesize of output 19 [2023-11-11 23:57:32,514 INFO L351 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 [2023-11-11 23:57:32,521 INFO L351 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 [2023-11-11 23:57:32,639 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-11 23:57:32,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:32,655 INFO L351 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 11 [2023-11-11 23:57:32,703 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-11 23:57:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-11 23:57:32,948 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= 0 (select .cse0 0)) .cse1 (not (and .cse1 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse2 0) 0) (= (store .cse2 0 0) .cse0)))) .cse3)) (<= |c_ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse3 (= c_~ARR_SIZE~0 1))) is different from false [2023-11-11 23:57:33,082 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|)) (.cse3 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (= 0 (select .cse0 0)) .cse1 (not (and .cse1 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse2 0) 0) (= (store .cse2 0 0) .cse0)))) .cse3)) (<= |c_ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse3 (= c_~ARR_SIZE~0 1)))) is different from true [2023-11-11 23:57:33,272 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse5 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse6 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and .cse0 .cse1 .cse2 .cse3 (<= 1 c_~ARR_SIZE~0) (< c_~ARR_SIZE~0 2) (not (and .cse0 .cse2 .cse3 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse4 0) 0) (= (store .cse4 0 0) .cse5)))) .cse6 .cse7)) .cse6 .cse7 (= c_~ARR_SIZE~0 1) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7))))) is different from false [2023-11-11 23:57:33,414 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse5 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse6 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse7 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and .cse0 .cse1 .cse2 .cse3 (<= 1 c_~ARR_SIZE~0) (< c_~ARR_SIZE~0 2) (not (and .cse0 .cse2 .cse3 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse4 0) 0) (= (store .cse4 0 0) .cse5)))) .cse6 .cse7)) .cse6 .cse7 (= c_~ARR_SIZE~0 1) (not (and .cse0 .cse1 .cse2 .cse3 .cse6 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse7)))))) is different from true [2023-11-11 23:57:33,617 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse5 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse7 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse8 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse9 (= |c_ULTIMATE.start_main_~index~0#1| 0))) (and .cse0 .cse1 .cse2 (not (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| Int) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| v_DerPreprocessor_1) |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5| v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|))) (and (= (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) (store .cse3 0 0)) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|)) (= (select .cse3 0) 0)))) .cse0 .cse2 .cse4 (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= .cse5 (store .cse6 0 0)) (= (select .cse6 0) 0)))) .cse7 .cse8 .cse9)) .cse4 (<= 1 c_~ARR_SIZE~0) (< c_~ARR_SIZE~0 2) .cse7 .cse8 (= c_~ARR_SIZE~0 1) .cse9 (not (and .cse0 .cse1 .cse2 .cse4 .cse7 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse8 .cse9))))) is different from false [2023-11-11 23:57:33,795 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse1 (= 0 (select .cse5 0))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse7 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse8 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse9 (= |c_ULTIMATE.start_main_~index~0#1| 0))) (and .cse0 .cse1 .cse2 (not (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| Int) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| v_DerPreprocessor_1) |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5| v_DerPreprocessor_2) |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|))) (and (= (select |c_#memory_int| |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5|) (store .cse3 0 0)) (not (= |v_ULTIMATE.start_main_~#array2~0#1.base_BEFORE_CALL_5| |v_ULTIMATE.start_main_~#array1~0#1.base_BEFORE_CALL_5|)) (= (select .cse3 0) 0)))) .cse0 .cse2 .cse4 (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= .cse5 (store .cse6 0 0)) (= (select .cse6 0) 0)))) .cse7 .cse8 .cse9)) .cse4 (<= 1 c_~ARR_SIZE~0) (< c_~ARR_SIZE~0 2) .cse7 .cse8 (= c_~ARR_SIZE~0 1) .cse9 (not (and .cse0 .cse1 .cse2 .cse4 .cse7 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse8 .cse9)))))) is different from true [2023-11-11 23:57:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-11 23:57:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 71 states and 139 transitions. [2023-11-11 23:57:34,036 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 139 transitions. [2023-11-11 23:57:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-11 23:57:34,038 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-11 23:57:34,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-11 23:57:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-11 23:57:34,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-11 23:57:34,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-11 23:57:34,114 INFO L351 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 10 treesize of output 8 [2023-11-11 23:57:34,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:34,148 INFO L351 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 14 treesize of output 14 [2023-11-11 23:57:34,153 INFO L351 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 [2023-11-11 23:57:34,276 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-11 23:57:34,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:34,290 INFO L351 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 47 [2023-11-11 23:57:34,298 INFO L351 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 47 treesize of output 26 [2023-11-11 23:57:34,303 INFO L351 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 [2023-11-11 23:57:34,306 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-11 23:57:34,307 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2023-11-11 23:57:35,155 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-11 23:57:35,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:35,163 INFO L351 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 11 [2023-11-11 23:57:35,557 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-11 23:57:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-11 23:57:35,587 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (select .cse3 0)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (<= .cse0 0) (= 0 .cse0) .cse1 (not (and .cse1 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse2 0) 0) (= (store .cse2 0 0) .cse3)))) .cse4)) (<= |c_ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 (= c_~ARR_SIZE~0 1)))) is different from false [2023-11-11 23:57:35,765 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (select .cse3 0)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (<= .cse0 0) (= 0 .cse0) .cse1 (not (and .cse1 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse2 0) 0) (= (store .cse2 0 0) .cse3)))) .cse4)) (<= |c_ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse4 (= c_~ARR_SIZE~0 1))))) is different from true [2023-11-11 23:57:35,771 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (select .cse6 0))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= 0 .cse1)) (.cse3 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse7 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse8 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4 (<= 1 c_~ARR_SIZE~0) (< c_~ARR_SIZE~0 2) (not (and .cse0 .cse3 .cse4 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse5 0) 0) (= (store .cse5 0 0) .cse6)))) .cse7 .cse8)) .cse7 .cse8 (= c_~ARR_SIZE~0 1) (not (and .cse0 .cse2 .cse3 .cse4 .cse7 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse8)))))) is different from false [2023-11-11 23:57:35,779 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (select .cse6 0))) (let ((.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= 0 .cse1)) (.cse3 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse7 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse8 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4 (<= 1 c_~ARR_SIZE~0) (< c_~ARR_SIZE~0 2) (not (and .cse0 .cse3 .cse4 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse5 0) 0) (= (store .cse5 0 0) .cse6)))) .cse7 .cse8)) .cse7 .cse8 (= c_~ARR_SIZE~0 1) (not (and .cse0 .cse2 .cse3 .cse4 .cse7 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse8))))))) is different from true [2023-11-11 23:57:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-11 23:57:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 75 states and 151 transitions. [2023-11-11 23:57:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 151 transitions. [2023-11-11 23:57:38,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-11 23:57:38,592 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-11 23:57:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-11 23:57:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-11 23:57:38,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-11 23:57:38,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-11 23:57:38,678 INFO L351 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 10 treesize of output 8 [2023-11-11 23:57:38,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:38,701 INFO L351 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 14 treesize of output 14 [2023-11-11 23:57:38,705 INFO L351 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 [2023-11-11 23:57:38,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:38,868 INFO L351 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 37 treesize of output 32 [2023-11-11 23:57:38,880 INFO L351 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 [2023-11-11 23:57:39,554 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-11 23:57:39,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:39,562 INFO L351 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 11 [2023-11-11 23:57:39,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-11 23:57:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-11 23:57:40,172 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse11 (select .cse10 0))) (let ((.cse1 (<= .cse11 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse8 (= 0 .cse11)) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse6 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse1 .cse8 .cse2 .cse3 (<= 1 c_~ARR_SIZE~0) (< c_~ARR_SIZE~0 2) (not (and .cse0 .cse2 .cse3 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse9 0) 0) (= (store .cse9 0 0) .cse10)))) .cse4 .cse6)) .cse4 .cse6 .cse7 (not (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6)))))) is different from false [2023-11-11 23:57:40,178 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse11 (select .cse10 0))) (let ((.cse1 (<= .cse11 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse8 (= 0 .cse11)) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse6 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse1 .cse8 .cse2 .cse3 (<= 1 c_~ARR_SIZE~0) (< c_~ARR_SIZE~0 2) (not (and .cse0 .cse2 .cse3 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse9 0) 0) (= (store .cse9 0 0) .cse10)))) .cse4 .cse6)) .cse4 .cse6 .cse7 (not (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6))))))) is different from true [2023-11-11 23:57:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-11 23:57:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 76 states and 156 transitions. [2023-11-11 23:57:41,379 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 156 transitions. [2023-11-11 23:57:41,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-11 23:57:41,380 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-11 23:57:41,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-11 23:57:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-11 23:57:41,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-11 23:57:41,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-11 23:57:41,492 INFO L351 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 10 treesize of output 8 [2023-11-11 23:57:41,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:41,517 INFO L351 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 14 treesize of output 14 [2023-11-11 23:57:41,521 INFO L351 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 [2023-11-11 23:57:41,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:41,643 INFO L351 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 37 treesize of output 32 [2023-11-11 23:57:41,647 INFO L351 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 [2023-11-11 23:57:41,893 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-11 23:57:41,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:41,900 INFO L351 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 58 treesize of output 11 [2023-11-11 23:57:41,957 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-11 23:57:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-11 23:57:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2023-11-11 23:57:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 76 states and 156 transitions. [2023-11-11 23:57:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 156 transitions. [2023-11-11 23:57:42,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-11 23:57:42,016 INFO L423 CodeCheckObserver]: Error Path is FOUND. [2023-11-11 23:57:42,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-11 23:57:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-11 23:57:42,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-11 23:57:42,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-11 23:57:42,090 INFO L351 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 10 treesize of output 8 [2023-11-11 23:57:42,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:42,111 INFO L351 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 14 treesize of output 14 [2023-11-11 23:57:42,115 INFO L351 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 [2023-11-11 23:57:42,255 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-11-11 23:57:42,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:42,261 INFO L351 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2023-11-11 23:57:42,268 INFO L351 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 [2023-11-11 23:57:42,272 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-11-11 23:57:42,272 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2023-11-11 23:57:43,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:43,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-11 23:57:43,694 INFO L322 Elim1Store]: treesize reduction 23, result has 43.9 percent of original size [2023-11-11 23:57:43,694 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 68 [2023-11-11 23:57:43,705 INFO L351 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 16 treesize of output 12 [2023-11-11 23:57:43,736 INFO L322 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2023-11-11 23:57:43,736 INFO L351 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 3 case distinctions, treesize of input 51 treesize of output 48 [2023-11-11 23:57:43,741 INFO L351 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 [2023-11-11 23:57:43,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2023-11-11 23:57:43,761 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-11 23:57:43,796 INFO L322 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-11 23:57:43,796 INFO L351 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 1 case distinctions, treesize of input 18 treesize of output 15 [2023-11-11 23:57:44,029 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-11 23:57:44,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-11 23:57:44,071 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (select .cse3 0)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (<= .cse0 0) (= 0 .cse0) .cse1 (not (and .cse1 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse2 0) 0) (= (store .cse2 0 0) .cse3)))) .cse4)) (<= |c_ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (store .cse5 0 0) .cse3) (= |c_ULTIMATE.start_main_~count~0#1| (select v_DerPreprocessor_7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (= (select .cse5 0) 0)))) .cse4 (= c_~ARR_SIZE~0 1)))) is different from false [2023-11-11 23:57:44,354 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (select .cse4 0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse6 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse7 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse9 (= c_~ARR_SIZE~0 1))) (and .cse0 (<= .cse1 0) (= 0 .cse1) .cse2 (not (and .cse2 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse3 0) 0) (= (store .cse3 0 0) .cse4)))) .cse5)) .cse6 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 1) (not (and .cse0 .cse2 .cse6 .cse7 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (store .cse8 0 0) .cse4) (= |c_ULTIMATE.start_main_~count~0#1| (select v_DerPreprocessor_7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (= (select .cse8 0) 0)))) .cse5 .cse9)) .cse7 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse9))) is different from false [2023-11-11 23:57:44,360 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse0 (select .cse3 0)) (.cse1 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse4 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (<= .cse0 0) (= 0 .cse0) .cse1 (not (and .cse1 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse2 0) 0) (= (store .cse2 0 0) .cse3)))) .cse4)) (<= |c_ULTIMATE.start_main_~sum~0#1| 0) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (store .cse5 0 0) .cse3) (= |c_ULTIMATE.start_main_~count~0#1| (select v_DerPreprocessor_7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (= (select .cse5 0) 0)))) .cse4 (= c_~ARR_SIZE~0 1))))) is different from true [2023-11-11 23:57:44,366 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse1 (select .cse4 0)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse6 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse7 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (<= |c_ULTIMATE.start_main_~count~0#1| 1)) (.cse9 (= c_~ARR_SIZE~0 1))) (and .cse0 (<= .cse1 0) (= 0 .cse1) .cse2 (not (and .cse2 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse3 0) 0) (= (store .cse3 0 0) .cse4)))) .cse5)) .cse6 (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|) 0) 1) (not (and .cse0 .cse2 .cse6 .cse7 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (store .cse8 0 0) .cse4) (= |c_ULTIMATE.start_main_~count~0#1| (select v_DerPreprocessor_7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (= (select .cse8 0) 0)))) .cse5 .cse9)) .cse7 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0) .cse5 .cse9)))) is different from true [2023-11-11 23:57:44,374 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse12 (select .cse10 0))) (let ((.cse1 (<= .cse12 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse8 (= 0 .cse12)) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse6 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse1 .cse8 .cse2 .cse3 (<= 1 c_~ARR_SIZE~0) (< c_~ARR_SIZE~0 2) (not (and .cse0 .cse2 .cse3 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse9 0) 0) (= (store .cse9 0 0) .cse10)))) .cse4 .cse6)) .cse4 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (store .cse11 0 0) .cse10) (= |c_ULTIMATE.start_main_~count~0#1| (select v_DerPreprocessor_7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (= (select .cse11 0) 0)))) .cse6 .cse7 (not (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6)))))) is different from false [2023-11-11 23:57:44,380 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse12 (select .cse10 0))) (let ((.cse1 (<= .cse12 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse8 (= 0 .cse12)) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse6 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse1 .cse8 .cse2 .cse3 (not (and .cse0 .cse2 .cse3 .cse4 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (store .cse9 0 0) .cse10) (= |c_ULTIMATE.start_main_~count~0#1| (select v_DerPreprocessor_7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (= (select .cse9 0) 0)))) .cse6 .cse7)) (<= 1 c_~ARR_SIZE~0) (< c_~ARR_SIZE~0 2) (not (and .cse0 .cse2 .cse3 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse11 0) 0) (= (store .cse11 0 0) .cse10)))) .cse4 .cse6)) .cse4 .cse6 .cse7 (not (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6)))))) is different from false [2023-11-11 23:57:44,388 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse12 (select .cse10 0))) (let ((.cse1 (<= .cse12 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse8 (= 0 .cse12)) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse6 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse1 .cse8 .cse2 .cse3 (<= 1 c_~ARR_SIZE~0) (< c_~ARR_SIZE~0 2) (not (and .cse0 .cse2 .cse3 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse9 0) 0) (= (store .cse9 0 0) .cse10)))) .cse4 .cse6)) .cse4 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (store .cse11 0 0) .cse10) (= |c_ULTIMATE.start_main_~count~0#1| (select v_DerPreprocessor_7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (= (select .cse11 0) 0)))) .cse6 .cse7 (not (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6))))))) is different from true [2023-11-11 23:57:44,394 WARN L876 $PredicateComparison]: unable to prove that (not (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse12 (select .cse10 0))) (let ((.cse1 (<= .cse12 0)) (.cse7 (= c_~ARR_SIZE~0 1)) (.cse0 (not (= |c_ULTIMATE.start_main_~#array2~0#1.base| |c_ULTIMATE.start_main_~#array1~0#1.base|))) (.cse8 (= 0 .cse12)) (.cse2 (= (+ |c_ULTIMATE.start_main_~num~0#1| 1) 0)) (.cse3 (<= |c_ULTIMATE.start_main_~sum~0#1| 0)) (.cse4 (= |c_ULTIMATE.start_main_~#array2~0#1.offset| 0)) (.cse5 (= |c_ULTIMATE.start_main_~#array1~0#1.offset| 0)) (.cse6 (<= |c_ULTIMATE.start_main_~count~0#1| 1))) (and .cse0 (not (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) .cse1 .cse8 .cse2 .cse3 (not (and .cse0 .cse2 .cse3 .cse4 (exists ((v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (store .cse9 0 0) .cse10) (= |c_ULTIMATE.start_main_~count~0#1| (select v_DerPreprocessor_7 |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (= (select .cse9 0) 0)))) .cse6 .cse7)) (<= 1 c_~ARR_SIZE~0) (< c_~ARR_SIZE~0 2) (not (and .cse0 .cse2 .cse3 (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#array2~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_main_~#array1~0#1.base| v_DerPreprocessor_2) |c_ULTIMATE.start_main_~#array2~0#1.base|))) (and (= (select .cse11 0) 0) (= (store .cse11 0 0) .cse10)))) .cse4 .cse6)) .cse4 .cse6 .cse7 (not (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6))))))) is different from true