./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-fpi/sina4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-fpi/sina4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:03:22,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:03:22,374 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 23:03:22,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:03:22,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:03:22,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:03:22,420 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:03:22,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:03:22,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:03:22,427 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:03:22,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:03:22,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:03:22,430 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:03:22,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:03:22,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 23:03:22,433 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:03:22,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:03:22,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:03:22,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:03:22,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 23:03:22,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:03:22,436 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 23:03:22,436 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:03:22,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 23:03:22,437 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:03:22,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:03:22,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:03:22,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:03:22,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:22,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:03:22,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:03:22,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 23:03:22,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:03:22,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:03:22,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:03:22,443 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 23:03:22,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:03:22,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:03:22,444 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:03:22,445 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/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_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 933eff495d93b07d12af9180ab5b75cc35fb173187f8af9883307194e1e7fea3 [2023-11-06 23:03:22,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:03:22,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:03:22,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:03:22,843 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:03:22,844 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:03:22,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/array-fpi/sina4.c [2023-11-06 23:03:26,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:03:26,346 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:03:26,346 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/sv-benchmarks/c/array-fpi/sina4.c [2023-11-06 23:03:26,354 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/data/6291ee2fa/767b6f9af7e943fdb4af754166bdea23/FLAG707bcbe46 [2023-11-06 23:03:26,370 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/data/6291ee2fa/767b6f9af7e943fdb4af754166bdea23 [2023-11-06 23:03:26,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:03:26,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:03:26,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:26,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:03:26,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:03:26,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:26" (1/1) ... [2023-11-06 23:03:26,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3edbdc12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:26, skipping insertion in model container [2023-11-06 23:03:26,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:26" (1/1) ... [2023-11-06 23:03:26,408 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:03:26,610 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_57b4f435-7274-4c1f-8914-bb8c447308dc/sv-benchmarks/c/array-fpi/sina4.c[588,601] [2023-11-06 23:03:26,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:26,643 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:03:26,660 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_57b4f435-7274-4c1f-8914-bb8c447308dc/sv-benchmarks/c/array-fpi/sina4.c[588,601] [2023-11-06 23:03:26,679 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:26,695 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:03:26,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:26 WrapperNode [2023-11-06 23:03:26,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:26,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:26,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:03:26,698 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:03:26,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:26" (1/1) ... [2023-11-06 23:03:26,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:26" (1/1) ... [2023-11-06 23:03:26,765 INFO L138 Inliner]: procedures = 17, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 106 [2023-11-06 23:03:26,766 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:26,767 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:03:26,767 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:03:26,767 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:03:26,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:26" (1/1) ... [2023-11-06 23:03:26,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:26" (1/1) ... [2023-11-06 23:03:26,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:26" (1/1) ... [2023-11-06 23:03:26,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:26" (1/1) ... [2023-11-06 23:03:26,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:26" (1/1) ... [2023-11-06 23:03:26,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:26" (1/1) ... [2023-11-06 23:03:26,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:26" (1/1) ... [2023-11-06 23:03:26,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:26" (1/1) ... [2023-11-06 23:03:26,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:03:26,823 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:03:26,823 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:03:26,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:03:26,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:26" (1/1) ... [2023-11-06 23:03:26,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:26,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:26,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:03:26,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:03:26,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:03:26,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:03:26,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:03:26,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:03:26,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 23:03:26,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:03:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:03:26,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:03:26,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:03:27,016 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:03:27,018 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:03:27,315 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:03:27,322 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:03:27,322 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-06 23:03:27,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:27 BoogieIcfgContainer [2023-11-06 23:03:27,325 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:03:27,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:03:27,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:03:27,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:03:27,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:03:26" (1/3) ... [2023-11-06 23:03:27,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7637d849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:27, skipping insertion in model container [2023-11-06 23:03:27,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:26" (2/3) ... [2023-11-06 23:03:27,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7637d849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:27, skipping insertion in model container [2023-11-06 23:03:27,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:27" (3/3) ... [2023-11-06 23:03:27,334 INFO L112 eAbstractionObserver]: Analyzing ICFG sina4.c [2023-11-06 23:03:27,350 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:03:27,351 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 23:03:27,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:03:27,404 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1e995bbe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:03:27,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 23:03:27,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 23:03:27,418 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:27,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:27,425 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:27,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:27,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2023-11-06 23:03:27,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:27,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210681748] [2023-11-06 23:03:27,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:27,619 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-06 23:03:27,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:27,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210681748] [2023-11-06 23:03:27,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210681748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:27,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:27,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:03:27,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933307869] [2023-11-06 23:03:27,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:27,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:03:27,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:27,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:03:27,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:03:27,669 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:27,687 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2023-11-06 23:03:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:03:27,689 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 23:03:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:27,697 INFO L225 Difference]: With dead ends: 50 [2023-11-06 23:03:27,697 INFO L226 Difference]: Without dead ends: 23 [2023-11-06 23:03:27,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:03:27,704 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:27,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 23:03:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-06 23:03:27,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-06 23:03:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:27,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-11-06 23:03:27,762 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2023-11-06 23:03:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:27,762 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-11-06 23:03:27,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-11-06 23:03:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 23:03:27,763 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:27,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:27,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:03:27,764 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:27,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2023-11-06 23:03:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:27,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668228296] [2023-11-06 23:03:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:28,083 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-06 23:03:28,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:28,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668228296] [2023-11-06 23:03:28,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668228296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:28,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:28,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:03:28,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150083231] [2023-11-06 23:03:28,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:28,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:28,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:28,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:28,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:28,090 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:28,216 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2023-11-06 23:03:28,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:03:28,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 23:03:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:28,219 INFO L225 Difference]: With dead ends: 53 [2023-11-06 23:03:28,219 INFO L226 Difference]: Without dead ends: 37 [2023-11-06 23:03:28,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:28,222 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:28,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:28,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-06 23:03:28,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2023-11-06 23:03:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:28,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-06 23:03:28,245 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2023-11-06 23:03:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:28,245 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-06 23:03:28,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-06 23:03:28,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 23:03:28,248 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:28,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:28,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:03:28,248 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:28,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:28,251 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2023-11-06 23:03:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:28,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548727797] [2023-11-06 23:03:28,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:28,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:30,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:30,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548727797] [2023-11-06 23:03:30,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548727797] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:30,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185151891] [2023-11-06 23:03:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:30,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:30,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:30,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:30,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 23:03:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:30,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-06 23:03:30,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:30,619 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-06 23:03:30,637 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 11 treesize of output 7 [2023-11-06 23:03:30,704 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 19 treesize of output 18 [2023-11-06 23:03:30,932 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 26 treesize of output 21 [2023-11-06 23:03:31,108 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 26 treesize of output 21 [2023-11-06 23:03:31,385 INFO L322 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2023-11-06 23:03:31,385 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 2 case distinctions, treesize of input 26 treesize of output 40 [2023-11-06 23:03:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:31,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:33,967 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.base| Int)) (= (select (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|) (+ c_~N~0 2))) is different from false [2023-11-06 23:03:34,452 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 23:03:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-06 23:03:34,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185151891] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:34,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:03:34,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 39 [2023-11-06 23:03:34,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590120862] [2023-11-06 23:03:34,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:34,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-06 23:03:34,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:34,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-06 23:03:34,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1215, Unknown=1, NotChecked=72, Total=1482 [2023-11-06 23:03:34,502 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:35,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:35,619 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2023-11-06 23:03:35,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 23:03:35,619 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-06 23:03:35,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:35,621 INFO L225 Difference]: With dead ends: 58 [2023-11-06 23:03:35,621 INFO L226 Difference]: Without dead ends: 56 [2023-11-06 23:03:35,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=300, Invalid=1865, Unknown=1, NotChecked=90, Total=2256 [2023-11-06 23:03:35,624 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 105 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:35,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 121 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 433 Invalid, 0 Unknown, 64 Unchecked, 0.5s Time] [2023-11-06 23:03:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-11-06 23:03:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2023-11-06 23:03:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2023-11-06 23:03:35,651 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 24 [2023-11-06 23:03:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:35,651 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2023-11-06 23:03:35,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2023-11-06 23:03:35,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 23:03:35,653 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:35,653 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:35,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:35,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:35,859 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:35,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:35,860 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2023-11-06 23:03:35,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:35,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324716000] [2023-11-06 23:03:35,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:35,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:35,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:03:35,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:35,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324716000] [2023-11-06 23:03:35,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324716000] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:35,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597204256] [2023-11-06 23:03:35,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:03:35,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:35,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:35,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:36,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 23:03:36,081 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 23:03:36,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:03:36,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:03:36,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:03:36,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:03:36,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597204256] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:36,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:03:36,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-06 23:03:36,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071256041] [2023-11-06 23:03:36,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:36,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:03:36,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:36,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:03:36,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:03:36,188 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:36,389 INFO L93 Difference]: Finished difference Result 110 states and 128 transitions. [2023-11-06 23:03:36,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:03:36,390 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-06 23:03:36,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:36,392 INFO L225 Difference]: With dead ends: 110 [2023-11-06 23:03:36,392 INFO L226 Difference]: Without dead ends: 66 [2023-11-06 23:03:36,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-11-06 23:03:36,394 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 49 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:36,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 56 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:03:36,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-06 23:03:36,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2023-11-06 23:03:36,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2023-11-06 23:03:36,407 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 26 [2023-11-06 23:03:36,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:36,408 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2023-11-06 23:03:36,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2023-11-06 23:03:36,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-06 23:03:36,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:36,410 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:36,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 23:03:36,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:36,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:36,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:36,616 INFO L85 PathProgramCache]: Analyzing trace with hash -587916192, now seen corresponding path program 3 times [2023-11-06 23:03:36,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:36,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884360854] [2023-11-06 23:03:36,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:36,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:03:36,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884360854] [2023-11-06 23:03:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884360854] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922880421] [2023-11-06 23:03:36,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:03:36,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:36,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:36,727 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:36,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 23:03:36,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 23:03:36,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:03:36,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:03:36,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:03:36,913 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 23:03:36,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922880421] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:36,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:03:36,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-11-06 23:03:36,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730876673] [2023-11-06 23:03:36,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:36,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-06 23:03:36,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:36,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-06 23:03:36,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-06 23:03:36,969 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:37,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:03:37,154 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2023-11-06 23:03:37,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:03:37,154 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-06 23:03:37,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:03:37,155 INFO L225 Difference]: With dead ends: 63 [2023-11-06 23:03:37,156 INFO L226 Difference]: Without dead ends: 50 [2023-11-06 23:03:37,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-11-06 23:03:37,157 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 75 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 23:03:37,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 48 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 23:03:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-11-06 23:03:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2023-11-06 23:03:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-06 23:03:37,167 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2023-11-06 23:03:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:03:37,167 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-06 23:03:37,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-06 23:03:37,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 23:03:37,169 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:03:37,169 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:37,180 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-06 23:03:37,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:37,375 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:03:37,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:37,375 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2023-11-06 23:03:37,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:37,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741600940] [2023-11-06 23:03:37,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:37,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:39,688 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:39,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:39,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741600940] [2023-11-06 23:03:39,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741600940] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:03:39,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905228376] [2023-11-06 23:03:39,689 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 23:03:39,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:03:39,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:39,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:03:39,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 23:03:39,801 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 23:03:39,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:03:39,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-06 23:03:39,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:03:39,824 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:03:39,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:03:39,891 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 21 treesize of output 20 [2023-11-06 23:03:40,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:03:40,051 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 32 treesize of output 34 [2023-11-06 23:03:40,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:03:40,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:03:40,460 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:03:40,461 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2023-11-06 23:03:40,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:03:40,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:03:40,672 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-06 23:03:40,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 55 [2023-11-06 23:03:41,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:03:41,103 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-06 23:03:41,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:03:41,310 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-06 23:03:41,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:03:41,629 INFO L322 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2023-11-06 23:03:41,629 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 50 [2023-11-06 23:03:41,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:03:42,044 INFO L322 Elim1Store]: treesize reduction 116, result has 30.1 percent of original size [2023-11-06 23:03:42,044 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 13 case distinctions, treesize of input 66 treesize of output 103 [2023-11-06 23:03:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:44,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:03:46,741 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= (+ c_~N~0 2) (select (let ((.cse0 (let ((.cse2 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) (.cse1 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse0 (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base| .cse0) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|)))) is different from false [2023-11-06 23:03:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 23:03:51,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905228376] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:03:51,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:03:51,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 67 [2023-11-06 23:03:51,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835071086] [2023-11-06 23:03:51,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:03:51,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-11-06 23:03:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:51,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-11-06 23:03:51,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=3870, Unknown=1, NotChecked=128, Total=4422 [2023-11-06 23:03:51,767 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 67 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:05,058 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse51 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse80 (+ .cse51 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse36 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse4 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse69 (select .cse8 .cse80))) (let ((.cse75 (+ .cse4 .cse69))) (let ((.cse64 (+ .cse51 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse27 (store .cse8 .cse80 .cse75)) (.cse5 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse10 (not (= |c_ULTIMATE.start_main_~i~0#1| 0))) (.cse9 (+ .cse4 .cse5)) (.cse23 (= c_~N~0 2)) (.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse27)) (.cse7 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse37 (+ (* c_~N~0 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) (.cse38 (not (= c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)))) (.cse0 (+ c_~N~0 2)) (.cse65 (select .cse8 .cse64))) (and (or (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= .cse0 (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| .cse9))) (store .cse6 .cse7 (+ (select .cse8 .cse7) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse1 (store (select .cse3 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse4 .cse5 1))) (.cse2 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse1 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse3 |ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1)))) (or .cse10 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= (select (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse8 .cse7 1)))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse15 (select .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse14 (select (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse15 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse20 (store .cse22 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse14 .cse15 .cse5)))) (let ((.cse19 (select (store .cse21 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse20) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse16 (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse13 (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse20))) (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse18 (store .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse14 .cse15 .cse5 .cse16)))) (store .cse18 .cse7 (+ (select (select (store .cse17 |c_ULTIMATE.start_main_~a~0#1.base| .cse18) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse19 .cse7)))))))) (let ((.cse11 (store (select .cse13 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse14 .cse15 .cse5 1 .cse16))) (.cse12 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse11 (+ .cse12 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse13 |ULTIMATE.start_main_~b~0#1.base| .cse11) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))))) |c_ULTIMATE.start_main_~b~0#1.offset|) 4)))) (= (select .cse8 0) 3) .cse23 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= .cse0 (select (let ((.cse24 (store (select .cse26 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (.cse25 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse24 (+ .cse25 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse26 |ULTIMATE.start_main_~b~0#1.base| .cse24) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (not (= |c_ULTIMATE.start_main_~#sum~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= .cse0 (select (let ((.cse32 (select .cse8 .cse37))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse32))))) (let ((.cse35 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse34 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse31 .cse32)))) (store .cse34 .cse7 (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse35 .cse7))))))) (let ((.cse28 (store (select .cse30 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse4 .cse31 .cse32 1))) (.cse29 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse28 (+ .cse29 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse30 |ULTIMATE.start_main_~b~0#1.base| .cse28) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1))) .cse38) (or .cse10 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= 4 (select (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 1) .cse7 1)))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse48 (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43 1)))) (let ((.cse47 (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse48) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse44 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse41 (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse48))) (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse46 (store .cse47 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse42 .cse43 .cse44 1)))) (store .cse46 .cse7 (+ (select .cse47 .cse7) (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (let ((.cse39 (store (select .cse41 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse42 .cse43 .cse44 2))) (.cse40 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse39 (+ .cse40 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse41 |ULTIMATE.start_main_~b~0#1.base| .cse39) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1)))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= 3 (select .cse8 8)) (or (= (select (store .cse8 .cse51 (+ .cse4 (select .cse8 .cse51))) 0) (+ c_~N~0 1)) (and (or (< 2 c_~N~0) (not (= |c_ULTIMATE.start_main_~i~0#1| 1))) (<= 2 c_~N~0) (<= |c_ULTIMATE.start_main_~i~0#1| 1))) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= 4 (select (let ((.cse55 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse9)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse7))) (let ((.cse57 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse55 .cse5))))) (let ((.cse59 (select .cse57 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse56 (select .cse59 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse54 (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse58 (store .cse59 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse55 .cse56 .cse5)))) (store .cse58 .cse7 (+ (select .cse59 .cse7) (select (select (store .cse57 |c_ULTIMATE.start_main_~a~0#1.base| .cse58) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse52 (store (select .cse54 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse4 .cse55 .cse56 .cse5 1))) (.cse53 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse52 (+ .cse53 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse54 |ULTIMATE.start_main_~b~0#1.base| .cse52) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1))) (not .cse23) (< |c_ULTIMATE.start_main_~i~0#1| 2)) (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2) (<= (+ 2 |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.base|))) (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= .cse0 (select (let ((.cse63 (store .cse27 .cse64 (+ .cse65 (select (select .cse26 |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) (let ((.cse62 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse63))) (let ((.cse60 (store (select .cse62 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (.cse61 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse60 (+ .cse61 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse62 |ULTIMATE.start_main_~b~0#1.base| .cse60) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= (select (let ((.cse71 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse75)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse37))) (let ((.cse72 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse4 .cse69 .cse71))))) (let ((.cse74 (select .cse72 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse70 (select .cse74 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse68 (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse73 (store .cse74 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse4 .cse69 .cse70 .cse71)))) (store .cse73 .cse7 (+ (select (select (store .cse72 |c_ULTIMATE.start_main_~a~0#1.base| .cse73) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse74 .cse7))))))) (let ((.cse66 (store (select .cse68 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse4 .cse69 .cse70 1 .cse71))) (.cse67 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse66 (+ .cse67 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse68 |ULTIMATE.start_main_~b~0#1.base| .cse66) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse0))) .cse38) (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= .cse0 (select (let ((.cse79 (store .cse8 .cse64 (+ .cse4 .cse65)))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse79))) (let ((.cse76 (store (select .cse78 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ (select .cse79 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (.cse77 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse76 (+ .cse77 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse78 |ULTIMATE.start_main_~b~0#1.base| .cse76) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse77 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))) |c_ULTIMATE.start_main_~b~0#1.offset|))))))))))) is different from true [2023-11-06 23:05:37,205 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse35 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse13 (not (= |c_ULTIMATE.start_main_~i~0#1| 0))) (.cse12 (+ .cse8 .cse9)) (.cse26 (= c_~N~0 2)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse11 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse36 (+ (* c_~N~0 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) (.cse71 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (+ c_~N~0 2)) (.cse37 (not (= c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= .cse0 (select (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse1 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select .cse3 (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (or .cse4 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= .cse0 (select (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse10 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse12))) (store .cse10 .cse11 (+ (select .cse3 .cse11) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse5 (store (select .cse7 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse8 .cse9 1))) (.cse6 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse5 (+ .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse7 |ULTIMATE.start_main_~b~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1)))) (or .cse13 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= (select (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse11 1)))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse17 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse23 (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18 .cse9)))) (let ((.cse22 (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse19 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse16 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse23))) (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse17 .cse18 .cse9 .cse19)))) (store .cse21 .cse11 (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse22 .cse11)))))))) (let ((.cse14 (store (select .cse16 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse17 .cse18 .cse9 1 .cse19))) (.cse15 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse14 (+ .cse15 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse16 |ULTIMATE.start_main_~b~0#1.base| .cse14) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))))) |c_ULTIMATE.start_main_~b~0#1.offset|) 4)))) .cse26 (or .cse4 (= (select .cse3 0) (+ c_~N~0 1))) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= .cse0 (select (let ((.cse31 (select .cse3 .cse36))) (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse31))))) (let ((.cse34 (select .cse32 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse30 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse29 (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse33 (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse8 .cse30 .cse31)))) (store .cse33 .cse11 (+ (select (select (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse34 .cse11))))))) (let ((.cse27 (store (select .cse29 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse8 .cse30 .cse31 1))) (.cse28 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse27 (+ .cse28 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse29 |ULTIMATE.start_main_~b~0#1.base| .cse27) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse28 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1))) .cse37) (or .cse13 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= 4 (select (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 1) .cse11 1)))) (let ((.cse49 (select .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse41 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse42 (select (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse47 (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse41 .cse42 1)))) (let ((.cse46 (select (store .cse48 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse47) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse43 (select .cse46 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse40 (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse47))) (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse45 (store .cse46 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse41 .cse42 .cse43 1)))) (store .cse45 .cse11 (+ (select .cse46 .cse11) (select (select (store .cse44 |c_ULTIMATE.start_main_~a~0#1.base| .cse45) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (let ((.cse38 (store (select .cse40 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse41 .cse42 .cse43 2))) (.cse39 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse38 (+ .cse39 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse40 |ULTIMATE.start_main_~b~0#1.base| .cse38) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1)))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= 4 (select .cse1 0)) (let ((.cse56 (select .cse1 8))) (let ((.cse50 (= .cse56 4)) (.cse55 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2))))) (or (and .cse50 (or (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse51 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= (+ 2 |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2)))) (= 3 (select .cse51 8)) (let ((.cse52 (* |ULTIMATE.start_main_~i~0#1| 8))) (= (+ (select .cse51 .cse52) 1) (select .cse1 .cse52))) (= 3 (select .cse51 0))))))) (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse53 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= 3 (select .cse53 8)) (let ((.cse54 (* |ULTIMATE.start_main_~i~0#1| 8))) (= (+ (select .cse53 .cse54) 1) (select .cse1 .cse54))) (= 3 (select .cse53 0)) (<= (+ 2 |ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (and .cse55 (= .cse56 3)) (and .cse50 (or (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse57 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= (+ 2 |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2)))) (= 3 (select .cse57 8)) (= 3 (select .cse57 0))))) .cse55 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse58 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= 3 (select .cse58 8)) (= 3 (select .cse58 0)) (<= (+ 2 |ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.base|)))))) (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse59 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= 3 (select .cse59 8)) (let ((.cse60 (* |ULTIMATE.start_main_~i~0#1| 8))) (= (+ (select .cse59 .cse60) 1) (select .cse1 .cse60))) (= 3 (select .cse59 0)) (<= (+ 2 |ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.base|)))) (not (= |ULTIMATE.start_main_~i~0#1| 1)))) (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse61 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= (+ 2 |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2)))) (= 3 (select .cse61 8)) (let ((.cse62 (* |ULTIMATE.start_main_~i~0#1| 8))) (= (+ (select .cse61 .cse62) 1) (select .cse1 .cse62))) (= 3 (select .cse61 0))))) (not (= |ULTIMATE.start_main_~i~0#1| 1))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= 4 (select (let ((.cse66 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse12)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse68 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse66 .cse9))))) (let ((.cse70 (select .cse68 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse67 (select .cse70 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse65 (store .cse68 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse69 (store .cse70 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse8 .cse66 .cse67 .cse9)))) (store .cse69 .cse11 (+ (select .cse70 .cse11) (select (select (store .cse68 |c_ULTIMATE.start_main_~a~0#1.base| .cse69) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse63 (store (select .cse65 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse8 .cse66 .cse67 .cse9 1))) (.cse64 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse63 (+ .cse64 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse65 |ULTIMATE.start_main_~b~0#1.base| .cse63) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse64 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1))) (not .cse26) (< |c_ULTIMATE.start_main_~i~0#1| 2)) (= .cse0 (select (store .cse1 .cse71 (+ (select .cse3 .cse71) 1)) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse0 (select .cse1 (+ .cse71 |c_ULTIMATE.start_main_~b~0#1.offset|))) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= (select (let ((.cse75 (select .cse3 (+ .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse77 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse75))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse36))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse35 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse75 .cse77))))) (let ((.cse80 (select .cse78 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse76 (select .cse80 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse74 (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse79 (store .cse80 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse8 .cse75 .cse76 .cse77)))) (store .cse79 .cse11 (+ (select (select (store .cse78 |c_ULTIMATE.start_main_~a~0#1.base| .cse79) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse80 .cse11))))))) (let ((.cse72 (store (select .cse74 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse8 .cse75 .cse76 1 .cse77))) (.cse73 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse72 (+ .cse73 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse74 |ULTIMATE.start_main_~b~0#1.base| .cse72) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse73 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse0))) .cse37))))) is different from true [2023-11-06 23:05:39,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:05:41,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:05:43,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:05:45,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:05:47,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:05:49,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:05:51,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 23:06:19,160 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse36 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse25 (* 8 |c_ULTIMATE.start_main_~i~0#1|)) (.cse7 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse8 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse12 (not (= |c_ULTIMATE.start_main_~i~0#1| 0))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse11 (+ .cse7 .cse8)) (.cse27 (= c_~N~0 2)) (.cse10 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse26 (select .cse3 (+ .cse25 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse37 (+ (* c_~N~0 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))) (.cse0 (+ c_~N~0 2)) (.cse38 (not (= c_~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|))))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= .cse0 (select (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse1 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select .cse3 (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (or (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0) (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= .cse0 (select (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse11))) (store .cse9 .cse10 (+ (select .cse3 .cse10) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse4 (store (select .cse6 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse7 .cse8 1))) (.cse5 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse4 (+ .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse6 |ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1)))) (or .cse12 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= (select (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse10 1)))) (let ((.cse24 (select .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse17 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse16 (select (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse8))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse22 (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse16 .cse17 .cse8)))) (let ((.cse21 (select (store .cse23 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse22) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse15 (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse22))) (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse20 (store .cse21 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse16 .cse17 .cse8 .cse18)))) (store .cse20 .cse10 (+ (select (select (store .cse19 |c_ULTIMATE.start_main_~a~0#1.base| .cse20) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse21 .cse10)))))))) (let ((.cse13 (store (select .cse15 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse16 .cse17 .cse8 1 .cse18))) (.cse14 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse13 (+ .cse14 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse15 |ULTIMATE.start_main_~b~0#1.base| .cse13) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))))) |c_ULTIMATE.start_main_~b~0#1.offset|) 4)))) (= .cse0 (select (store .cse1 (+ .cse25 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ .cse26 1)) |c_ULTIMATE.start_main_~b~0#1.offset|)) .cse27 (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= .cse0 (select (let ((.cse32 (select .cse3 .cse37))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse32))))) (let ((.cse35 (select .cse33 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse31 (select .cse35 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse30 (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse34 (store .cse35 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse7 .cse31 .cse32)))) (store .cse34 .cse10 (+ (select (select (store .cse33 |c_ULTIMATE.start_main_~a~0#1.base| .cse34) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse35 .cse10))))))) (let ((.cse28 (store (select .cse30 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse7 .cse31 .cse32 1))) (.cse29 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse28 (+ .cse29 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse30 |ULTIMATE.start_main_~b~0#1.base| .cse28) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse29 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1))) .cse38) (or .cse12 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= 4 (select (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 1) .cse10 1)))) (let ((.cse50 (select .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse42 (select .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse43 (select (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse48 (store .cse50 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse42 .cse43 1)))) (let ((.cse47 (select (store .cse49 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse48) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse44 (select .cse47 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse41 (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse48))) (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse46 (store .cse47 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse42 .cse43 .cse44 1)))) (store .cse46 .cse10 (+ (select .cse47 .cse10) (select (select (store .cse45 |c_ULTIMATE.start_main_~a~0#1.base| .cse46) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (let ((.cse39 (store (select .cse41 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse42 .cse43 .cse44 2))) (.cse40 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse39 (+ .cse40 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse41 |ULTIMATE.start_main_~b~0#1.base| .cse39) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse40 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1)))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= 4 (select .cse1 0)) (let ((.cse57 (select .cse1 8))) (let ((.cse51 (= .cse57 4)) (.cse56 (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int) (|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (and (<= (+ |c_ULTIMATE.start_main_~b~0#1.base| 2) |ULTIMATE.start_main_~#sum~0#1.base|) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2))))) (or (and .cse51 (or (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse52 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= (+ 2 |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2)))) (= 3 (select .cse52 8)) (let ((.cse53 (* |ULTIMATE.start_main_~i~0#1| 8))) (= (+ (select .cse52 .cse53) 1) (select .cse1 .cse53))) (= 3 (select .cse52 0))))))) (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse54 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= 3 (select .cse54 8)) (let ((.cse55 (* |ULTIMATE.start_main_~i~0#1| 8))) (= (+ (select .cse54 .cse55) 1) (select .cse1 .cse55))) (= 3 (select .cse54 0)) (<= (+ 2 |ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.base|)))))))) (and .cse56 (= .cse57 3)) (and .cse51 (or (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse58 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= (+ 2 |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2)))) (= 3 (select .cse58 8)) (= 3 (select .cse58 0))))) .cse56 (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse59 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= 3 (select .cse59 8)) (= 3 (select .cse59 0)) (<= (+ 2 |ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.base|)))))) (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse60 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (= 3 (select .cse60 8)) (let ((.cse61 (* |ULTIMATE.start_main_~i~0#1| 8))) (= (+ (select .cse60 .cse61) 1) (select .cse1 .cse61))) (= 3 (select .cse60 0)) (<= (+ 2 |ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.base|)))) (not (= |ULTIMATE.start_main_~i~0#1| 1)))) (exists ((|ULTIMATE.start_main_~i~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (let ((.cse62 (select |c_#memory_int| |ULTIMATE.start_main_~a~0#1.base|))) (and (exists ((|ULTIMATE.start_main_~#sum~0#1.base| Int)) (and (<= (+ 2 |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.base|) (exists ((|ULTIMATE.start_main_~#sum~0#1.offset| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~#sum~0#1.base|) |ULTIMATE.start_main_~#sum~0#1.offset|) 2)))) (= 3 (select .cse62 8)) (let ((.cse63 (* |ULTIMATE.start_main_~i~0#1| 8))) (= (+ (select .cse62 .cse63) 1) (select .cse1 .cse63))) (= 3 (select .cse62 0))))) (not (= |ULTIMATE.start_main_~i~0#1| 1))))))) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= 4 (select (let ((.cse67 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse11)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse10))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse67 .cse8))))) (let ((.cse71 (select .cse69 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse68 (select .cse71 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse66 (store .cse69 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse70 (store .cse71 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse7 .cse67 .cse68 .cse8)))) (store .cse70 .cse10 (+ (select .cse71 .cse10) (select (select (store .cse69 |c_ULTIMATE.start_main_~a~0#1.base| .cse70) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse64 (store (select .cse66 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse7 .cse67 .cse68 .cse8 1))) (.cse65 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse64 (+ .cse65 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse66 |ULTIMATE.start_main_~b~0#1.base| .cse64) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse65 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1))) (not .cse27) (< |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= (select (let ((.cse76 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse26))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse37))) (let ((.cse77 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse7 .cse26 .cse76))))) (let ((.cse79 (select .cse77 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse75 (select .cse79 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse74 (store .cse77 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse78 (store .cse79 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse7 .cse26 .cse75 .cse76)))) (store .cse78 .cse10 (+ (select (select (store .cse77 |c_ULTIMATE.start_main_~a~0#1.base| .cse78) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse79 .cse10))))))) (let ((.cse72 (store (select .cse74 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse7 .cse26 .cse75 1 .cse76))) (.cse73 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse72 (+ .cse73 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse74 |ULTIMATE.start_main_~b~0#1.base| .cse72) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse73 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|) .cse0))) .cse38))))) is different from true [2023-11-06 23:06:25,541 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse46 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse8 (select .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse4 (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (.cse13 (not (= |c_ULTIMATE.start_main_~i~0#1| 0))) (.cse12 (+ .cse8 .cse9)) (.cse11 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse0 (+ c_~N~0 2)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (= .cse0 (select (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse1 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select .cse3 (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|)))) (or .cse4 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= .cse0 (select (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse10 (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| .cse12))) (store .cse10 .cse11 (+ (select .cse3 .cse11) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse10) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse5 (store (select .cse7 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse8 .cse9 1))) (.cse6 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse5 (+ .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse7 |ULTIMATE.start_main_~b~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1)))) (or .cse13 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_71| 1) (= (select (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse11 1)))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse18 (select .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse17 (select (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse18 .cse9))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse23 (store .cse25 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse17 .cse18 .cse9)))) (let ((.cse22 (select (store .cse24 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse23) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse19 (select .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse16 (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse23))) (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse21 (store .cse22 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse17 .cse18 .cse9 .cse19)))) (store .cse21 .cse11 (+ (select (select (store .cse20 |c_ULTIMATE.start_main_~a~0#1.base| .cse21) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse22 .cse11)))))))) (let ((.cse14 (store (select .cse16 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse17 .cse18 .cse9 1 .cse19))) (.cse15 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse14 (+ .cse15 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse16 |ULTIMATE.start_main_~b~0#1.base| .cse14) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))))) |c_ULTIMATE.start_main_~b~0#1.offset|) 4)))) (or .cse4 (= (select .cse3 0) (+ c_~N~0 1))) (or .cse13 (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= 4 (select (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 1) .cse11 1)))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse29 (select .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse30 (select (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse35 (store .cse37 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse29 .cse30 1)))) (let ((.cse34 (select (store .cse36 |c_ULTIMATE.start_main_~#sum~0#1.base| .cse35) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse31 (select .cse34 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse28 (let ((.cse32 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| .cse35))) (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse33 (store .cse34 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse29 .cse30 .cse31 1)))) (store .cse33 .cse11 (+ (select .cse34 .cse11) (select (select (store .cse32 |c_ULTIMATE.start_main_~a~0#1.base| .cse33) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))))) (let ((.cse26 (store (select .cse28 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse29 .cse30 .cse31 2))) (.cse27 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse26 (+ .cse27 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse28 |ULTIMATE.start_main_~b~0#1.base| .cse26) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse27 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1)))) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (or (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (= 4 (select (let ((.cse41 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| .cse12)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse11))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse46 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse8 .cse41 .cse9))))) (let ((.cse45 (select .cse43 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse42 (select .cse45 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse40 (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse44 (store .cse45 |c_ULTIMATE.start_main_~a~0#1.offset| (+ .cse8 .cse41 .cse42 .cse9)))) (store .cse44 .cse11 (+ (select .cse45 .cse11) (select (select (store .cse43 |c_ULTIMATE.start_main_~a~0#1.base| .cse44) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))))))) (let ((.cse38 (store (select .cse40 |ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (+ .cse8 .cse41 .cse42 .cse9 1))) (.cse39 (* |v_ULTIMATE.start_main_~i~0#1_71| 8))) (store .cse38 (+ .cse39 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store .cse40 |ULTIMATE.start_main_~b~0#1.base| .cse38) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse39 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))))))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_71| 1))) (not (= c_~N~0 2)) (< |c_ULTIMATE.start_main_~i~0#1| 2)) (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (= .cse0 (select .cse1 0)) (= .cse0 (select (let ((.cse47 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store .cse1 .cse47 (+ (select .cse3 .cse47) 1))) 0)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0))))) is different from true [2023-11-06 23:06:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:32,746 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2023-11-06 23:06:32,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-11-06 23:06:32,747 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-06 23:06:32,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:32,749 INFO L225 Difference]: With dead ends: 155 [2023-11-06 23:06:32,750 INFO L226 Difference]: Without dead ends: 153 [2023-11-06 23:06:32,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 145 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 6276 ImplicationChecksByTransitivity, 144.9s TimeCoverageRelationStatistics Valid=1649, Invalid=18366, Unknown=27, NotChecked=1420, Total=21462 [2023-11-06 23:06:32,760 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 227 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 226 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 413 IncrementalHoareTripleChecker+Unchecked, 25.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:32,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 478 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1342 Invalid, 7 Unknown, 413 Unchecked, 25.4s Time] [2023-11-06 23:06:32,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-06 23:06:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 82. [2023-11-06 23:06:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 81 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2023-11-06 23:06:32,805 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 32 [2023-11-06 23:06:32,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:32,805 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2023-11-06 23:06:32,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2023-11-06 23:06:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 23:06:32,807 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:32,807 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:06:32,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-06 23:06:33,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 23:06:33,013 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:33,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash -396535210, now seen corresponding path program 5 times [2023-11-06 23:06:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:33,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904794200] [2023-11-06 23:06:33,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:33,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 23:06:33,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:33,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904794200] [2023-11-06 23:06:33,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904794200] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:06:33,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678106249] [2023-11-06 23:06:33,187 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 23:06:33,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:33,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:06:33,192 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:06:33,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 23:06:33,385 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-06 23:06:33,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:06:33,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 23:06:33,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:06:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 23:06:33,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:06:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-06 23:06:33,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678106249] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:06:33,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:06:33,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2023-11-06 23:06:33,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047385166] [2023-11-06 23:06:33,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:06:33,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 23:06:33,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:33,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 23:06:33,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-11-06 23:06:33,650 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:34,210 INFO L93 Difference]: Finished difference Result 212 states and 242 transitions. [2023-11-06 23:06:34,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 23:06:34,211 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-06 23:06:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:34,212 INFO L225 Difference]: With dead ends: 212 [2023-11-06 23:06:34,212 INFO L226 Difference]: Without dead ends: 160 [2023-11-06 23:06:34,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2023-11-06 23:06:34,214 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 252 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:34,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 95 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 23:06:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-06 23:06:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 114. [2023-11-06 23:06:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.1592920353982301) internal successors, (131), 113 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:34,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 131 transitions. [2023-11-06 23:06:34,298 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 131 transitions. Word has length 36 [2023-11-06 23:06:34,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:34,298 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 131 transitions. [2023-11-06 23:06:34,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:34,299 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 131 transitions. [2023-11-06 23:06:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 23:06:34,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:34,300 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:06:34,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 23:06:34,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 23:06:34,508 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:34,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:34,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1737020496, now seen corresponding path program 1 times [2023-11-06 23:06:34,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:34,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983758988] [2023-11-06 23:06:34,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:34,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:37,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:37,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983758988] [2023-11-06 23:06:37,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983758988] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:06:37,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775089307] [2023-11-06 23:06:37,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:37,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:37,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:06:37,692 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:06:37,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 23:06:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:37,810 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-06 23:06:37,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:06:37,966 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 23:06:37,967 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2023-11-06 23:06:37,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 23:06:38,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-06 23:06:38,320 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-06 23:06:38,802 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-06 23:06:39,055 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-06 23:06:39,324 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-06 23:06:39,560 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-06 23:06:39,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2023-11-06 23:06:40,060 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-06 23:06:40,673 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:40,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:06:41,093 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 (Array Int Int))) (= (select (let ((.cse0 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (store v_ArrVal_302 (+ .cse0 8 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_302) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse0 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))) (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)) (+ c_~N~0 2))) is different from false [2023-11-06 23:06:41,269 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 (Array Int Int))) (= (+ c_~N~0 1) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_302) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-11-06 23:06:41,279 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse0 .cse1))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_302) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (+ c_~N~0 1))) is different from false [2023-11-06 23:06:41,571 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_302 (Array Int Int))) (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (store .cse0 .cse1 (+ (select .cse2 .cse1) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_302) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ c_~N~0 1))) is different from false [2023-11-06 23:06:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-06 23:06:44,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775089307] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:06:44,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:06:44,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 24, 23] total 72 [2023-11-06 23:06:44,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019816425] [2023-11-06 23:06:44,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:06:44,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-11-06 23:06:44,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:44,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-11-06 23:06:44,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=4164, Unknown=31, NotChecked=540, Total=5112 [2023-11-06 23:06:44,313 INFO L87 Difference]: Start difference. First operand 114 states and 131 transitions. Second operand has 72 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:52,816 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2023-11-06 23:06:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-06 23:06:52,817 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-06 23:06:52,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:52,818 INFO L225 Difference]: With dead ends: 135 [2023-11-06 23:06:52,818 INFO L226 Difference]: Without dead ends: 108 [2023-11-06 23:06:52,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=688, Invalid=6779, Unknown=31, NotChecked=692, Total=8190 [2023-11-06 23:06:52,822 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 89 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 224 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:52,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 142 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 949 Invalid, 0 Unknown, 224 Unchecked, 1.9s Time] [2023-11-06 23:06:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-06 23:06:52,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2023-11-06 23:06:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.158878504672897) internal successors, (124), 107 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:52,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2023-11-06 23:06:52,875 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 36 [2023-11-06 23:06:52,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:52,876 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2023-11-06 23:06:52,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2023-11-06 23:06:52,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-06 23:06:52,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:52,878 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:06:52,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 23:06:53,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 23:06:53,084 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:53,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:53,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1245131882, now seen corresponding path program 6 times [2023-11-06 23:06:53,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:53,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934770897] [2023-11-06 23:06:53,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 23:06:53,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:53,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934770897] [2023-11-06 23:06:53,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934770897] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:06:53,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469909710] [2023-11-06 23:06:53,253 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 23:06:53,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:53,253 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:06:53,260 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:06:53,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 23:06:53,397 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-11-06 23:06:53,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:06:53,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 23:06:53,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:06:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 23:06:53,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:06:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-06 23:06:53,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469909710] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 23:06:53,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 23:06:53,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-06 23:06:53,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490343349] [2023-11-06 23:06:53,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 23:06:53,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 23:06:53,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:06:53,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 23:06:53,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-06 23:06:53,614 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:53,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 23:06:53,960 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2023-11-06 23:06:53,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 23:06:53,960 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-11-06 23:06:53,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 23:06:53,961 INFO L225 Difference]: With dead ends: 134 [2023-11-06 23:06:53,962 INFO L226 Difference]: Without dead ends: 104 [2023-11-06 23:06:53,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-11-06 23:06:53,963 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 111 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 23:06:53,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 66 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 23:06:53,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-06 23:06:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2023-11-06 23:06:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2023-11-06 23:06:54,010 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 36 [2023-11-06 23:06:54,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 23:06:54,010 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2023-11-06 23:06:54,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:06:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2023-11-06 23:06:54,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 23:06:54,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 23:06:54,012 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:06:54,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-06 23:06:54,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-06 23:06:54,218 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 23:06:54,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:06:54,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221586, now seen corresponding path program 7 times [2023-11-06 23:06:54,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:06:54,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960737838] [2023-11-06 23:06:54,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:06:54,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:06:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:06:57,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:06:57,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960737838] [2023-11-06 23:06:57,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960737838] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 23:06:57,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162847246] [2023-11-06 23:06:57,955 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 23:06:57,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 23:06:57,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:06:57,957 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 23:06:57,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57b4f435-7274-4c1f-8914-bb8c447308dc/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 23:06:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:06:58,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-06 23:06:58,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:06:58,191 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-06 23:06:58,200 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 11 treesize of output 7 [2023-11-06 23:06:58,287 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 19 treesize of output 18 [2023-11-06 23:06:58,477 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 26 treesize of output 28 [2023-11-06 23:06:58,730 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-11-06 23:06:59,030 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 40 treesize of output 41 [2023-11-06 23:06:59,241 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 40 treesize of output 41 [2023-11-06 23:06:59,447 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 40 treesize of output 41 [2023-11-06 23:06:59,707 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 40 treesize of output 41 [2023-11-06 23:06:59,928 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 40 treesize of output 41 [2023-11-06 23:07:00,160 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 40 treesize of output 41 [2023-11-06 23:07:00,511 INFO L322 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2023-11-06 23:07:00,511 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 2 case distinctions, treesize of input 40 treesize of output 60 [2023-11-06 23:07:00,900 INFO L322 Elim1Store]: treesize reduction 84, result has 24.3 percent of original size [2023-11-06 23:07:00,900 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 61 treesize of output 84 [2023-11-06 23:07:01,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:07:01,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 23:07:01,402 INFO L322 Elim1Store]: treesize reduction 148, result has 25.3 percent of original size [2023-11-06 23:07:01,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 5 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 24 case distinctions, treesize of input 82 treesize of output 125 [2023-11-06 23:07:07,636 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:07:07,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 23:07:10,818 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.base| Int) (|v_ULTIMATE.start_main_~i~0#1_152| Int)) (or (= (+ c_~N~0 2) (select (let ((.cse0 (let ((.cse3 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse2 (store (select |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1)))) (store .cse2 (+ .cse3 8 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 1))))) (.cse1 (* 8 |v_ULTIMATE.start_main_~i~0#1_152|))) (store .cse0 (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|) (+ (select (select (store |c_#memory_int| |ULTIMATE.start_main_~b~0#1.base| .cse0) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| .cse1)) 1))) |c_ULTIMATE.start_main_~b~0#1.offset|)) (< |v_ULTIMATE.start_main_~i~0#1_152| (+ 2 |c_ULTIMATE.start_main_~i~0#1|)))) is different from false