./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-tiling/revcpyswp2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/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_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/array-tiling/revcpyswp2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/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_c636404b-5fe4-4e95-9740-37713f8d276e/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 e5d836305a9654c4a87b407d535438bc329bb78fc0805b3b823600303a7df507 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:04:48,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:04:48,142 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:04:48,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:04:48,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:04:48,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:04:48,184 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:04:48,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:04:48,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:04:48,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:04:48,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:04:48,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:04:48,189 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:04:48,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:04:48,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:04:48,192 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:04:48,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:04:48,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:04:48,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:04:48,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:04:48,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:04:48,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:04:48,198 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:04:48,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:04:48,199 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:04:48,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:04:48,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:04:48,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:04:48,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:04:48,202 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:04:48,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:04:48,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:04:48,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:04:48,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:04:48,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:04:48,206 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:04:48,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:04:48,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:04:48,207 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:04:48,208 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_c636404b-5fe4-4e95-9740-37713f8d276e/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_c636404b-5fe4-4e95-9740-37713f8d276e/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 -> e5d836305a9654c4a87b407d535438bc329bb78fc0805b3b823600303a7df507 [2023-11-06 22:04:48,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:04:48,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:04:48,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:04:48,587 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:04:48,588 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:04:48,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/array-tiling/revcpyswp2.c [2023-11-06 22:04:52,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:04:52,333 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:04:52,333 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/sv-benchmarks/c/array-tiling/revcpyswp2.c [2023-11-06 22:04:52,342 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/data/d98354a54/00e02d504e7649f6ab8b8449302dec6d/FLAGfa12f0ca6 [2023-11-06 22:04:52,362 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/data/d98354a54/00e02d504e7649f6ab8b8449302dec6d [2023-11-06 22:04:52,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:04:52,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:04:52,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:04:52,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:04:52,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:04:52,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:04:52" (1/1) ... [2023-11-06 22:04:52,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4263c9c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:52, skipping insertion in model container [2023-11-06 22:04:52,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:04:52" (1/1) ... [2023-11-06 22:04:52,420 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:04:52,592 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_c636404b-5fe4-4e95-9740-37713f8d276e/sv-benchmarks/c/array-tiling/revcpyswp2.c[432,445] [2023-11-06 22:04:52,621 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:04:52,634 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:04:52,648 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_c636404b-5fe4-4e95-9740-37713f8d276e/sv-benchmarks/c/array-tiling/revcpyswp2.c[432,445] [2023-11-06 22:04:52,661 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:04:52,676 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:04:52,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:52 WrapperNode [2023-11-06 22:04:52,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:04:52,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:04:52,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:04:52,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:04:52,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:52" (1/1) ... [2023-11-06 22:04:52,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:52" (1/1) ... [2023-11-06 22:04:52,724 INFO L138 Inliner]: procedures = 16, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 111 [2023-11-06 22:04:52,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:04:52,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:04:52,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:04:52,729 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:04:52,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:52" (1/1) ... [2023-11-06 22:04:52,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:52" (1/1) ... [2023-11-06 22:04:52,744 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:52" (1/1) ... [2023-11-06 22:04:52,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:52" (1/1) ... [2023-11-06 22:04:52,752 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:52" (1/1) ... [2023-11-06 22:04:52,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:52" (1/1) ... [2023-11-06 22:04:52,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:52" (1/1) ... [2023-11-06 22:04:52,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:52" (1/1) ... [2023-11-06 22:04:52,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:04:52,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:04:52,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:04:52,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:04:52,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:52" (1/1) ... [2023-11-06 22:04:52,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:04:52,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:04:52,831 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:04:52,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:04:52,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:04:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:04:52,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:04:52,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:04:52,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:04:52,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:04:52,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:04:53,032 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:04:53,034 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:04:53,396 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:04:53,406 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:04:53,406 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-06 22:04:53,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:04:53 BoogieIcfgContainer [2023-11-06 22:04:53,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:04:53,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:04:53,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:04:53,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:04:53,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:04:52" (1/3) ... [2023-11-06 22:04:53,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aaf19b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:04:53, skipping insertion in model container [2023-11-06 22:04:53,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:04:52" (2/3) ... [2023-11-06 22:04:53,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aaf19b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:04:53, skipping insertion in model container [2023-11-06 22:04:53,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:04:53" (3/3) ... [2023-11-06 22:04:53,428 INFO L112 eAbstractionObserver]: Analyzing ICFG revcpyswp2.c [2023-11-06 22:04:53,453 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:04:53,453 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:04:53,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:04:53,542 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;@f5167b0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:04:53,543 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:04:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 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 22:04:53,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:04:53,559 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:04:53,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:53,562 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:04:53,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1560213877, now seen corresponding path program 1 times [2023-11-06 22:04:53,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:53,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174079790] [2023-11-06 22:04:53,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:53,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:53,888 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 22:04:53,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174079790] [2023-11-06 22:04:53,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174079790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:04:53,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:04:53,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:04:53,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516237748] [2023-11-06 22:04:53,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:04:53,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:04:53,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:53,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:04:53,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:04:53,965 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 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 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 22:04:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:04:53,988 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2023-11-06 22:04:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:04:53,991 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2023-11-06 22:04:53,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:04:54,000 INFO L225 Difference]: With dead ends: 47 [2023-11-06 22:04:54,000 INFO L226 Difference]: Without dead ends: 21 [2023-11-06 22:04:54,004 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 22:04:54,010 INFO L413 NwaCegarLoop]: 31 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, 31 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 22:04:54,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:04:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-06 22:04:54,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-06 22:04:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 22:04:54,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-11-06 22:04:54,081 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2023-11-06 22:04:54,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:04:54,082 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-11-06 22:04:54,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 22:04:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-11-06 22:04:54,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 22:04:54,085 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:04:54,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:54,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:04:54,086 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:04:54,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:54,087 INFO L85 PathProgramCache]: Analyzing trace with hash 631559685, now seen corresponding path program 1 times [2023-11-06 22:04:54,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:54,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347813279] [2023-11-06 22:04:54,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:54,394 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 22:04:54,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:54,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347813279] [2023-11-06 22:04:54,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347813279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:04:54,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:04:54,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:04:54,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881885566] [2023-11-06 22:04:54,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:04:54,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:04:54,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:54,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:04:54,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:04:54,403 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 22:04:54,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:04:54,483 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2023-11-06 22:04:54,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:04:54,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2023-11-06 22:04:54,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:04:54,486 INFO L225 Difference]: With dead ends: 39 [2023-11-06 22:04:54,487 INFO L226 Difference]: Without dead ends: 23 [2023-11-06 22:04:54,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:04:54,495 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:04:54,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:04:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-06 22:04:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2023-11-06 22:04:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 22:04:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-11-06 22:04:54,511 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2023-11-06 22:04:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:04:54,511 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-11-06 22:04:54,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 22:04:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-11-06 22:04:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:04:54,514 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:04:54,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:54,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:04:54,516 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:04:54,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:54,518 INFO L85 PathProgramCache]: Analyzing trace with hash -971977821, now seen corresponding path program 1 times [2023-11-06 22:04:54,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:54,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688930289] [2023-11-06 22:04:54,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:54,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:04:54,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:54,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688930289] [2023-11-06 22:04:54,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688930289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:04:54,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:04:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:04:54,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073911006] [2023-11-06 22:04:54,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:04:54,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:04:54,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:04:54,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:04:54,697 INFO L87 Difference]: Start difference. First operand 22 states and 26 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 22:04:54,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:04:54,801 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2023-11-06 22:04:54,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:04:54,802 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 22:04:54,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:04:54,803 INFO L225 Difference]: With dead ends: 48 [2023-11-06 22:04:54,804 INFO L226 Difference]: Without dead ends: 35 [2023-11-06 22:04:54,804 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 22:04:54,808 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:04:54,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 15 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:04:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-06 22:04:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2023-11-06 22:04:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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 22:04:54,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-11-06 22:04:54,818 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2023-11-06 22:04:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:04:54,819 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-11-06 22:04:54,819 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 22:04:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-11-06 22:04:54,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 22:04:54,820 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:04:54,820 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] [2023-11-06 22:04:54,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:04:54,821 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:04:54,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:54,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1185722883, now seen corresponding path program 1 times [2023-11-06 22:04:54,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:54,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329389601] [2023-11-06 22:04:54,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:54,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:04:54,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:54,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329389601] [2023-11-06 22:04:54,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329389601] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:04:54,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634107072] [2023-11-06 22:04:54,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:54,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:54,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:04:54,958 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:04:54,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:04:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:55,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:04:55,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:04:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:04:55,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:04:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:04:55,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634107072] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:04:55,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:04:55,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-06 22:04:55,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533575962] [2023-11-06 22:04:55,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:04:55,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:04:55,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:55,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:04:55,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:04:55,232 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 22:04:55,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:04:55,302 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2023-11-06 22:04:55,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:04:55,302 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 22 [2023-11-06 22:04:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:04:55,303 INFO L225 Difference]: With dead ends: 47 [2023-11-06 22:04:55,304 INFO L226 Difference]: Without dead ends: 28 [2023-11-06 22:04:55,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:04:55,305 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:04:55,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:04:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-06 22:04:55,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2023-11-06 22:04:55,312 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 22:04:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-11-06 22:04:55,313 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 22 [2023-11-06 22:04:55,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:04:55,314 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-11-06 22:04:55,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 22:04:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-11-06 22:04:55,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-06 22:04:55,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:04:55,315 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] [2023-11-06 22:04:55,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:04:55,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:55,523 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:04:55,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:55,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1086929509, now seen corresponding path program 2 times [2023-11-06 22:04:55,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:55,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376195568] [2023-11-06 22:04:55,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:55,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:55,664 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:04:55,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:55,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376195568] [2023-11-06 22:04:55,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376195568] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:04:55,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063617663] [2023-11-06 22:04:55,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:04:55,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:55,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:04:55,667 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:04:55,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:04:55,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:04:55,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:04:55,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:04:55,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:04:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:04:55,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:04:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-06 22:04:55,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063617663] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:04:55,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:04:55,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-06 22:04:55,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970401769] [2023-11-06 22:04:55,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:04:55,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:04:55,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:55,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:04:55,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:04:55,949 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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 22:04:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:04:56,087 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2023-11-06 22:04:56,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:04:56,088 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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 22:04:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:04:56,089 INFO L225 Difference]: With dead ends: 64 [2023-11-06 22:04:56,089 INFO L226 Difference]: Without dead ends: 49 [2023-11-06 22:04:56,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:04:56,091 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 55 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:04:56,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 23 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:04:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-06 22:04:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2023-11-06 22:04:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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 22:04:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2023-11-06 22:04:56,099 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 24 [2023-11-06 22:04:56,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:04:56,099 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2023-11-06 22:04:56,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 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 22:04:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2023-11-06 22:04:56,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-06 22:04:56,101 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:04:56,101 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] [2023-11-06 22:04:56,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:04:56,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:56,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:04:56,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1519365621, now seen corresponding path program 3 times [2023-11-06 22:04:56,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:56,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981845887] [2023-11-06 22:04:56,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:56,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:59,816 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 22:04:59,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:59,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981845887] [2023-11-06 22:04:59,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981845887] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:04:59,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922688128] [2023-11-06 22:04:59,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:04:59,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:59,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:04:59,826 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:04:59,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:04:59,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 22:04:59,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:04:59,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-06 22:04:59,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:05:00,070 INFO L322 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-11-06 22:05:00,071 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 140 [2023-11-06 22:05:00,408 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-06 22:05:00,419 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:05:00,738 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2023-11-06 22:05:00,750 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 20 treesize of output 18 [2023-11-06 22:05:00,909 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 22:05:00,909 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 39 [2023-11-06 22:05:00,923 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 24 treesize of output 22 [2023-11-06 22:05:01,284 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 58 [2023-11-06 22:05:01,314 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2023-11-06 22:05:01,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:01,631 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 64 [2023-11-06 22:05:01,644 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 34 [2023-11-06 22:05:01,651 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2023-11-06 22:05:01,910 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2023-11-06 22:05:01,918 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-06 22:05:01,924 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 9 treesize of output 7 [2023-11-06 22:05:01,989 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-06 22:05:01,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 48 [2023-11-06 22:05:01,999 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-11-06 22:05:02,008 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 13 treesize of output 9 [2023-11-06 22:05:02,352 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 22:05:02,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:05:02,589 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (forall ((v_ArrVal_231 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (* |ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_231))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0)))))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~SIZE~0))) is different from false [2023-11-06 22:05:02,914 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_59| Int) (v_ArrVal_231 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_59| 1) c_~SIZE~0) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_59| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_229 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_231))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2023-11-06 22:05:02,944 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_229 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_59| Int) (v_ArrVal_231 (Array Int Int))) (or (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_59| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_229 (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_231))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |v_ULTIMATE.start_main_~i~0#1_59| 1) c_~SIZE~0))) is different from false [2023-11-06 22:05:03,017 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_15| Int) (v_ArrVal_229 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_59| Int) (v_ArrVal_231 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_59| 1) c_~SIZE~0) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_59| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse3))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3 |v_ULTIMATE.start_main_~tmp~0#1_15|))))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_229 (+ .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_231))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))))) is different from false [2023-11-06 22:05:03,055 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_15| Int) (v_ArrVal_229 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_59| Int) (v_ArrVal_231 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_59| 1) c_~SIZE~0) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_59| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse2 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse3))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3 |v_ULTIMATE.start_main_~tmp~0#1_15|))))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_229 (+ .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_231))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))))) is different from false [2023-11-06 22:05:03,139 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_15| Int) (v_ArrVal_229 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_59| Int) (v_ArrVal_231 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse9 (* |v_ULTIMATE.start_main_~i~0#1_59| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (+ .cse3 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (store (select (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse8 (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 .cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse6))) |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse2 (store .cse4 .cse6 (select .cse7 .cse8)))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select .cse4 .cse5)))))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5 |v_ULTIMATE.start_main_~tmp~0#1_15|))))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.base| .cse1) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_229 (+ .cse9 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_231))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (< (+ |v_ULTIMATE.start_main_~i~0#1_59| 1) c_~SIZE~0))) is different from false [2023-11-06 22:05:03,197 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_15| Int) (v_ArrVal_229 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_59| Int) (v_ArrVal_231 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_59| 1) c_~SIZE~0) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (* |v_ULTIMATE.start_main_~i~0#1_59| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse1 (select (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~b~0#1.offset| (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select .cse4 .cse2)))))) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse1 .cse2 |v_ULTIMATE.start_main_~tmp~0#1_15|)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_229 (+ .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_231))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))))) is different from false [2023-11-06 22:05:03,815 WARN L839 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~i~0#1| Int)) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) c_~SIZE~0) (forall ((v_ArrVal_227 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_15| Int) (v_ArrVal_223 Int) (v_ArrVal_229 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_59| Int) (v_ArrVal_231 (Array Int Int)) (v_ArrVal_222 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_59| 1) c_~SIZE~0) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (* |v_ULTIMATE.start_main_~i~0#1_59| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse1 (select (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| (select v_ArrVal_222 |c_ULTIMATE.start_main_~b~0#1.offset|))) |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~b~0#1.offset| (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select .cse4 .cse2)))))) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse1 .cse2 |v_ULTIMATE.start_main_~tmp~0#1_15|)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_229 (+ .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_231))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))))))) is different from false [2023-11-06 22:05:03,986 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_15| Int) (v_ArrVal_223 Int) (v_ArrVal_229 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_59| Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_231 (Array Int Int)) (v_ArrVal_222 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_59| 1) c_~SIZE~0) (let ((.cse1 (* 4 c_~SIZE~0))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (* |v_ULTIMATE.start_main_~i~0#1_59| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse2 (select (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* (- 4) |c_ULTIMATE.start_main_~i~0#1|) (- 4) .cse1)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_223)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (select v_ArrVal_222 |c_ULTIMATE.start_main_~b~0#1.offset|))) |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~b~0#1.offset| (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select .cse5 .cse3)))))) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 .cse3 |v_ULTIMATE.start_main_~tmp~0#1_15|)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_229 (+ .cse7 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_231))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) .cse1)) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (< (+ |v_ULTIMATE.start_main_~i~0#1_66| 1) c_~SIZE~0))) is different from false [2023-11-06 22:05:04,069 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_15| Int) (v_ArrVal_223 Int) (v_ArrVal_229 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_59| Int) (|v_ULTIMATE.start_main_~i~0#1_66| Int) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_231 (Array Int Int)) (v_ArrVal_222 (Array Int Int)) (v_ArrVal_225 (Array Int Int))) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0)))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (* |v_ULTIMATE.start_main_~i~0#1_59| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse2 (select (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse1))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_66| 4)) v_ArrVal_223)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (select v_ArrVal_222 |c_ULTIMATE.start_main_~b~0#1.offset|))) |c_ULTIMATE.start_main_~b~0#1.base|))) (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~b~0#1.offset| (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select .cse5 .cse3)))))) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 .cse3 |v_ULTIMATE.start_main_~tmp~0#1_15|)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_229 (+ .cse7 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_231))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse1)))) (< (+ |v_ULTIMATE.start_main_~i~0#1_59| 1) c_~SIZE~0) (< (+ |v_ULTIMATE.start_main_~i~0#1_66| 1) c_~SIZE~0))) is different from false [2023-11-06 22:05:08,475 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:08,476 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2732 treesize of output 1473 [2023-11-06 22:05:09,085 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:09,089 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 677718 treesize of output 663134 [2023-11-06 22:05:09,333 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 1460 treesize of output 1362 [2023-11-06 22:05:09,394 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 2836 treesize of output 2738 [2023-11-06 22:05:09,599 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:09,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1865 treesize of output 1758 [2023-11-06 22:05:09,678 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:09,679 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 1719 treesize of output 1517 [2023-11-06 22:05:18,322 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 23 treesize of output 16 [2023-11-06 22:05:18,344 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 3 [2023-11-06 22:05:18,387 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 3 [2023-11-06 22:05:18,406 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:05:18,409 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:05:18,439 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:05:18,442 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:05:18,452 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:05:18,456 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:05:18,463 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:05:18,466 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:05:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2023-11-06 22:05:18,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922688128] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:05:18,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:05:18,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 23] total 58 [2023-11-06 22:05:18,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107425514] [2023-11-06 22:05:18,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:05:18,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-06 22:05:18,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:18,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-06 22:05:18,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=384, Invalid=1885, Unknown=27, NotChecked=1010, Total=3306 [2023-11-06 22:05:18,972 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 58 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 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 22:05:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:46,805 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2023-11-06 22:05:46,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-11-06 22:05:46,806 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 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 30 [2023-11-06 22:05:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:46,808 INFO L225 Difference]: With dead ends: 210 [2023-11-06 22:05:46,809 INFO L226 Difference]: Without dead ends: 208 [2023-11-06 22:05:46,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 22 SyntacticMatches, 17 SemanticMatches, 138 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 5922 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=2758, Invalid=14021, Unknown=31, NotChecked=2650, Total=19460 [2023-11-06 22:05:46,819 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 749 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 440 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 2356 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:46,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 156 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 521 Invalid, 6 Unknown, 2356 Unchecked, 2.6s Time] [2023-11-06 22:05:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-11-06 22:05:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 70. [2023-11-06 22:05:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 69 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 22:05:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2023-11-06 22:05:46,846 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 30 [2023-11-06 22:05:46,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:46,846 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2023-11-06 22:05:46,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 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 22:05:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2023-11-06 22:05:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 22:05:46,848 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:46,848 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] [2023-11-06 22:05:46,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:05:47,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:05:47,055 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:47,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:47,055 INFO L85 PathProgramCache]: Analyzing trace with hash 392313387, now seen corresponding path program 1 times [2023-11-06 22:05:47,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:47,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479667025] [2023-11-06 22:05:47,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:47,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,514 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 22:05:49,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:49,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479667025] [2023-11-06 22:05:49,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479667025] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:05:49,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484010615] [2023-11-06 22:05:49,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:49,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:05:49,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:05:49,522 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:05:49,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:05:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:49,635 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-06 22:05:49,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:05:49,653 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:05:49,654 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 23 treesize of output 19 [2023-11-06 22:05:49,894 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2023-11-06 22:05:49,904 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 20 treesize of output 18 [2023-11-06 22:05:50,032 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2023-11-06 22:05:50,039 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-06 22:05:50,045 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 9 treesize of output 7 [2023-11-06 22:05:50,112 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 58 [2023-11-06 22:05:50,124 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2023-11-06 22:05:50,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:50,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:50,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:50,406 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 38 treesize of output 38 [2023-11-06 22:05:50,413 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2023-11-06 22:05:50,470 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2023-11-06 22:05:50,485 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-06 22:05:50,490 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 19 treesize of output 15 [2023-11-06 22:05:50,830 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 22:05:50,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:05:51,010 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_324 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_324))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8)))))) is different from false [2023-11-06 22:05:51,023 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_324 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse1 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_324))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8)))))) is different from false [2023-11-06 22:05:51,036 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_19| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_321))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select (store .cse1 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_19|)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select .cse2 (+ .cse3 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_324))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2023-11-06 22:05:51,048 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_19| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_321))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_19|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_324))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8))))))) is different from false [2023-11-06 22:05:51,082 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_19| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (+ .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse5))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5 (select .cse3 .cse4))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_19|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_324))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2023-11-06 22:05:51,232 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_321 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_19| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (+ .cse6 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse4 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse3 .cse4 (select v_ArrVal_317 .cse5))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5 (select .cse3 .cse4))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_19|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_324))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2023-11-06 22:05:51,255 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_321 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_19| Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse4 .cse1 (select v_ArrVal_317 .cse3))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3 (select .cse4 .cse1)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_19|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse2 .cse3))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_324))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2023-11-06 22:05:51,405 INFO L322 Elim1Store]: treesize reduction 88, result has 40.9 percent of original size [2023-11-06 22:05:51,406 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1448 treesize of output 1040 [2023-11-06 22:05:51,446 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:51,446 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 347 treesize of output 325 [2023-11-06 22:05:51,476 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:51,476 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 271 treesize of output 229 [2023-11-06 22:05:51,577 INFO L322 Elim1Store]: treesize reduction 37, result has 60.6 percent of original size [2023-11-06 22:05:51,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 326 treesize of output 329 [2023-11-06 22:05:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-11-06 22:05:52,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484010615] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:05:52,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:05:52,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 44 [2023-11-06 22:05:52,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996739696] [2023-11-06 22:05:52,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:05:52,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-06 22:05:52,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:52,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-06 22:05:52,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1069, Unknown=27, NotChecked=532, Total=1892 [2023-11-06 22:05:52,350 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 44 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 44 states have internal predecessors, (81), 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 22:06:02,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-06 22:06:07,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:07,236 INFO L93 Difference]: Finished difference Result 205 states and 236 transitions. [2023-11-06 22:06:07,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-11-06 22:06:07,237 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 44 states have internal predecessors, (81), 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 34 [2023-11-06 22:06:07,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:07,240 INFO L225 Difference]: With dead ends: 205 [2023-11-06 22:06:07,240 INFO L226 Difference]: Without dead ends: 203 [2023-11-06 22:06:07,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 48 SyntacticMatches, 14 SemanticMatches, 85 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2261 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=910, Invalid=5404, Unknown=34, NotChecked=1134, Total=7482 [2023-11-06 22:06:07,244 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 323 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 94 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 1176 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:07,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 134 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 516 Invalid, 26 Unknown, 1176 Unchecked, 3.4s Time] [2023-11-06 22:06:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-06 22:06:07,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 90. [2023-11-06 22:06:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 89 states have internal predecessors, (110), 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 22:06:07,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2023-11-06 22:06:07,287 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 34 [2023-11-06 22:06:07,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:07,288 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2023-11-06 22:06:07,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.8409090909090908) internal successors, (81), 44 states have internal predecessors, (81), 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 22:06:07,288 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2023-11-06 22:06:07,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 22:06:07,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:07,290 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] [2023-11-06 22:06:07,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:07,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-06 22:06:07,496 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:07,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:07,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1953198257, now seen corresponding path program 4 times [2023-11-06 22:06:07,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:07,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901422309] [2023-11-06 22:06:07,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:07,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:07,690 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 22:06:07,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:07,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901422309] [2023-11-06 22:06:07,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901422309] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:06:07,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872314594] [2023-11-06 22:06:07,690 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:06:07,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:07,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:07,694 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:06:07,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:06:07,809 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:06:07,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:06:07,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:06:07,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:06:07,907 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:06:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:06:07,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872314594] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:06:07,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:06:07,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-11-06 22:06:07,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751543228] [2023-11-06 22:06:07,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:06:07,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 22:06:07,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:07,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 22:06:07,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-11-06 22:06:07,981 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 22:06:08,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:08,312 INFO L93 Difference]: Finished difference Result 197 states and 231 transitions. [2023-11-06 22:06:08,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:06:08,313 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 34 [2023-11-06 22:06:08,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:08,314 INFO L225 Difference]: With dead ends: 197 [2023-11-06 22:06:08,314 INFO L226 Difference]: Without dead ends: 112 [2023-11-06 22:06:08,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:06:08,316 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 78 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:08,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 77 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:06:08,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-06 22:06:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 86. [2023-11-06 22:06:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.188235294117647) internal successors, (101), 85 states have internal predecessors, (101), 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 22:06:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2023-11-06 22:06:08,352 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 34 [2023-11-06 22:06:08,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:08,352 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2023-11-06 22:06:08,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 22:06:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2023-11-06 22:06:08,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-06 22:06:08,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:08,354 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:08,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:08,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-06 22:06:08,560 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:08,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:08,560 INFO L85 PathProgramCache]: Analyzing trace with hash -480782803, now seen corresponding path program 5 times [2023-11-06 22:06:08,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:08,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908558924] [2023-11-06 22:06:08,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:08,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-06 22:06:08,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:08,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908558924] [2023-11-06 22:06:08,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908558924] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:06:08,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498307636] [2023-11-06 22:06:08,738 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:06:08,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:08,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:08,742 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:06:08,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:06:11,760 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-11-06 22:06:11,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:06:11,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:06:11,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:06:11,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:06:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-06 22:06:11,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498307636] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:06:11,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:06:11,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-11-06 22:06:11,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119491544] [2023-11-06 22:06:11,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:06:11,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:06:11,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:11,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:06:11,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:06:11,950 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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 22:06:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:12,266 INFO L93 Difference]: Finished difference Result 107 states and 121 transitions. [2023-11-06 22:06:12,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:06:12,267 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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 38 [2023-11-06 22:06:12,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:12,268 INFO L225 Difference]: With dead ends: 107 [2023-11-06 22:06:12,268 INFO L226 Difference]: Without dead ends: 97 [2023-11-06 22:06:12,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:06:12,269 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 130 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:12,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 65 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:06:12,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-06 22:06:12,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 68. [2023-11-06 22:06:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 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 22:06:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2023-11-06 22:06:12,299 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 38 [2023-11-06 22:06:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:12,300 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2023-11-06 22:06:12,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 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 22:06:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2023-11-06 22:06:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-11-06 22:06:12,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:12,301 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:12,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:12,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:12,509 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:12,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:12,510 INFO L85 PathProgramCache]: Analyzing trace with hash -825388789, now seen corresponding path program 6 times [2023-11-06 22:06:12,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:12,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294316371] [2023-11-06 22:06:12,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:12,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:06:12,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:12,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294316371] [2023-11-06 22:06:12,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294316371] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:06:12,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377965861] [2023-11-06 22:06:12,743 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:06:12,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:12,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:12,746 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:06:12,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:06:13,345 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-11-06 22:06:13,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:06:13,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:06:13,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:13,513 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:06:13,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:06:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-06 22:06:13,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377965861] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:06:13,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:06:13,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-06 22:06:13,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286596726] [2023-11-06 22:06:13,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:06:13,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:06:13,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:13,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:06:13,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:06:13,639 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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 22:06:14,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:14,093 INFO L93 Difference]: Finished difference Result 196 states and 219 transitions. [2023-11-06 22:06:14,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:06:14,094 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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 40 [2023-11-06 22:06:14,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:14,095 INFO L225 Difference]: With dead ends: 196 [2023-11-06 22:06:14,095 INFO L226 Difference]: Without dead ends: 143 [2023-11-06 22:06:14,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 7 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2023-11-06 22:06:14,097 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 94 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:14,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 107 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:06:14,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-06 22:06:14,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 107. [2023-11-06 22:06:14,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.1320754716981132) internal successors, (120), 106 states have internal predecessors, (120), 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 22:06:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2023-11-06 22:06:14,154 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 40 [2023-11-06 22:06:14,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:14,156 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2023-11-06 22:06:14,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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 22:06:14,156 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2023-11-06 22:06:14,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-06 22:06:14,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:14,157 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:14,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:14,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:06:14,364 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:14,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:14,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2009086429, now seen corresponding path program 2 times [2023-11-06 22:06:14,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:14,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230456605] [2023-11-06 22:06:14,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:14,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:18,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230456605] [2023-11-06 22:06:18,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230456605] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:06:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857973136] [2023-11-06 22:06:18,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:06:18,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:18,997 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:18,997 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:06:19,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:06:19,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:06:19,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:06:19,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-06 22:06:19,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:19,187 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:06:19,188 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 23 treesize of output 19 [2023-11-06 22:06:19,795 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2023-11-06 22:06:19,800 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 22 treesize of output 20 [2023-11-06 22:06:20,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:20,019 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2023-11-06 22:06:20,026 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 22 treesize of output 20 [2023-11-06 22:06:20,326 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2023-11-06 22:06:20,333 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2023-11-06 22:06:20,339 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 9 treesize of output 7 [2023-11-06 22:06:20,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 60 [2023-11-06 22:06:20,428 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 33 [2023-11-06 22:06:20,435 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 22 treesize of output 18 [2023-11-06 22:06:20,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2023-11-06 22:06:20,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:20,665 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 65 treesize of output 29 [2023-11-06 22:06:20,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:20,930 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 32 treesize of output 32 [2023-11-06 22:06:20,935 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 17 [2023-11-06 22:06:21,004 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 35 [2023-11-06 22:06:21,010 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2023-11-06 22:06:21,018 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 9 treesize of output 7 [2023-11-06 22:06:21,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:21,077 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 46 [2023-11-06 22:06:21,086 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2023-11-06 22:06:21,093 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 13 treesize of output 9 [2023-11-06 22:06:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:21,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:06:21,864 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_783 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_783))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8)))))) is different from false [2023-11-06 22:06:21,879 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int)) (or (forall ((v_ArrVal_783 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_157| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_783))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) (< |v_ULTIMATE.start_main_~i~0#1_157| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2023-11-06 22:06:21,900 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (or (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_157| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_782 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_783))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8))))) (< |v_ULTIMATE.start_main_~i~0#1_157| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2023-11-06 22:06:21,921 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (or (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (* |v_ULTIMATE.start_main_~i~0#1_157| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse1 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_782 (+ .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_783))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (< |v_ULTIMATE.start_main_~i~0#1_157| (+ 2 |c_ULTIMATE.start_main_~i~0#1|)))) is different from false [2023-11-06 22:06:21,950 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int) (|v_ULTIMATE.start_main_~tmp~0#1_45| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (or (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_157| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select (store .cse1 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_45|)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select .cse2 (+ .cse3 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_782 (+ .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_783))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)))) (< |v_ULTIMATE.start_main_~i~0#1_157| (+ 2 |c_ULTIMATE.start_main_~i~0#1|)))) is different from false [2023-11-06 22:06:23,996 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int) (|v_ULTIMATE.start_main_~tmp~0#1_45| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_157| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_45|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_782 (+ .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_783))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8)))))) (< |v_ULTIMATE.start_main_~i~0#1_157| 2))) is different from false [2023-11-06 22:06:24,058 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int) (|v_ULTIMATE.start_main_~tmp~0#1_45| Int) (|v_ULTIMATE.start_main_~tmp~0#1_46| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_157| 2) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse5 (* |v_ULTIMATE.start_main_~i~0#1_157| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse4 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4 |v_ULTIMATE.start_main_~tmp~0#1_46|)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_45|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_782 (+ .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_783))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8)))))))) is different from false [2023-11-06 22:06:26,096 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_161| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int) (|v_ULTIMATE.start_main_~tmp~0#1_45| Int) (|v_ULTIMATE.start_main_~tmp~0#1_46| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_157| 2) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse5 (* |v_ULTIMATE.start_main_~i~0#1_157| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse3 (* |v_ULTIMATE.start_main_~i~0#1_161| 4))) (let ((.cse4 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse4))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4 |v_ULTIMATE.start_main_~tmp~0#1_46|)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_45|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_782 (+ .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_783))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8)))))))) (< |v_ULTIMATE.start_main_~i~0#1_161| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2023-11-06 22:06:26,206 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int) (|v_ULTIMATE.start_main_~tmp~0#1_45| Int) (|v_ULTIMATE.start_main_~tmp~0#1_46| Int) (|v_ULTIMATE.start_main_~i~0#1_161| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int)) (v_ArrVal_775 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_157| 2) (< |v_ULTIMATE.start_main_~i~0#1_161| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse10 (* |v_ULTIMATE.start_main_~i~0#1_157| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_161| 4))) (let ((.cse5 (+ .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (store (select (let ((.cse3 (let ((.cse9 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse8 (+ .cse9 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 .cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8 (select .cse6 .cse7)))))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_775) |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 .cse5)))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5 |v_ULTIMATE.start_main_~tmp~0#1_46|)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_45|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_782 (+ .cse10 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_783))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8)))))))) is different from false [2023-11-06 22:06:26,392 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int) (|v_ULTIMATE.start_main_~tmp~0#1_45| Int) (|v_ULTIMATE.start_main_~tmp~0#1_46| Int) (|v_ULTIMATE.start_main_~i~0#1_161| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int)) (v_ArrVal_775 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_157| 2) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse10 (* |v_ULTIMATE.start_main_~i~0#1_157| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_161| 4))) (let ((.cse5 (+ .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (store (select (let ((.cse3 (let ((.cse9 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse8 (+ .cse9 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 .cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8 (select .cse6 .cse7)))))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_775) |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 .cse5)))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5 |v_ULTIMATE.start_main_~tmp~0#1_46|)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_45|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_782 (+ .cse10 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_783))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8)))))) (< |v_ULTIMATE.start_main_~i~0#1_161| (+ 2 |c_ULTIMATE.start_main_~i~0#1|)))) is different from false [2023-11-06 22:06:26,646 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int) (|v_ULTIMATE.start_main_~tmp~0#1_45| Int) (|v_ULTIMATE.start_main_~tmp~0#1_46| Int) (|v_ULTIMATE.start_main_~i~0#1_161| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_783 (Array Int Int)) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_157| 2) (< |v_ULTIMATE.start_main_~i~0#1_161| (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse10 (* |v_ULTIMATE.start_main_~i~0#1_157| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse4 (* |v_ULTIMATE.start_main_~i~0#1_161| 4))) (let ((.cse5 (+ .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (store (select (let ((.cse3 (let ((.cse9 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse8 (+ .cse9 4 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse9 |c_ULTIMATE.start_main_~b~0#1.offset|)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse6 .cse7 (select v_ArrVal_774 .cse8))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse8 (select .cse6 .cse7)))))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_775) |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse3 .cse5)))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse5 |v_ULTIMATE.start_main_~tmp~0#1_46|)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_45|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_782 (+ .cse10 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_783))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8)))))))) is different from false [2023-11-06 22:06:28,703 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int) (v_ArrVal_771 Int) (|v_ULTIMATE.start_main_~tmp~0#1_45| Int) (|v_ULTIMATE.start_main_~tmp~0#1_46| Int) (|v_ULTIMATE.start_main_~i~0#1_161| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_772 (Array Int Int)) (v_ArrVal_783 (Array Int Int)) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (* |v_ULTIMATE.start_main_~i~0#1_157| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse5 (* |v_ULTIMATE.start_main_~i~0#1_161| 4))) (let ((.cse6 (+ .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|))) (store (select (let ((.cse4 (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_771)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_772) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select v_ArrVal_772 |c_ULTIMATE.start_main_~b~0#1.offset|))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 .cse1 (select v_ArrVal_774 .cse3))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3 (select .cse7 .cse1))))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_775) |c_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|) (select .cse4 .cse6)))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6 |v_ULTIMATE.start_main_~tmp~0#1_46|)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_45|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse2 .cse3))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_782 (+ .cse8 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_783))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8)))))) (< |v_ULTIMATE.start_main_~i~0#1_157| 2) (< |v_ULTIMATE.start_main_~i~0#1_161| 2))) is different from false [2023-11-06 22:06:28,877 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_165| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_157| Int) (v_ArrVal_771 Int) (|v_ULTIMATE.start_main_~tmp~0#1_45| Int) (|v_ULTIMATE.start_main_~tmp~0#1_46| Int) (|v_ULTIMATE.start_main_~i~0#1_161| Int) (v_ArrVal_780 (Array Int Int)) (v_ArrVal_782 (Array Int Int)) (v_ArrVal_772 (Array Int Int)) (v_ArrVal_783 (Array Int Int)) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_157| 2) (< |v_ULTIMATE.start_main_~i~0#1_161| 2) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (* |v_ULTIMATE.start_main_~i~0#1_157| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse5 (* |v_ULTIMATE.start_main_~i~0#1_161| 4))) (let ((.cse6 (+ .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|))) (store (select (let ((.cse4 (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_165| 4)) v_ArrVal_771)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_772) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select v_ArrVal_772 |c_ULTIMATE.start_main_~b~0#1.offset|))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse7 .cse1 (select v_ArrVal_774 .cse3))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse3 (select .cse7 .cse1))))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_775) |c_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|) (select .cse4 .cse6)))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6 |v_ULTIMATE.start_main_~tmp~0#1_46|)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_780) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_45|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse2 .cse3))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_782) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_782 (+ .cse8 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_783))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8)))))))) (< |v_ULTIMATE.start_main_~i~0#1_165| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2023-11-06 22:06:29,593 INFO L322 Elim1Store]: treesize reduction 88, result has 40.9 percent of original size [2023-11-06 22:06:29,595 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29338 treesize of output 23854 [2023-11-06 22:06:29,673 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:06:29,673 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 690 treesize of output 682 [2023-11-06 22:06:29,690 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:06:29,702 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:06:29,711 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 229 treesize of output 222 [2023-11-06 22:06:29,739 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:06:29,739 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 334 treesize of output 326 [2023-11-06 22:06:29,768 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:06:29,769 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 309 treesize of output 275 [2023-11-06 22:06:30,217 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:06:30,217 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 32 treesize of output 23 [2023-11-06 22:06:30,360 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:06:30,361 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 466 treesize of output 456 [2023-11-06 22:06:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 23 not checked. [2023-11-06 22:06:31,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857973136] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:06:31,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:06:31,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 26] total 73 [2023-11-06 22:06:31,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709936043] [2023-11-06 22:06:31,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:06:31,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-11-06 22:06:31,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:31,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-11-06 22:06:31,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=3209, Unknown=45, NotChecked=1664, Total=5256 [2023-11-06 22:06:31,463 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 73 states, 73 states have (on average 1.6027397260273972) internal successors, (117), 73 states have internal predecessors, (117), 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 22:06:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:43,818 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2023-11-06 22:06:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-06 22:06:43,819 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.6027397260273972) internal successors, (117), 73 states have internal predecessors, (117), 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 42 [2023-11-06 22:06:43,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:43,820 INFO L225 Difference]: With dead ends: 138 [2023-11-06 22:06:43,820 INFO L226 Difference]: Without dead ends: 136 [2023-11-06 22:06:43,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 43 SyntacticMatches, 17 SemanticMatches, 124 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 4245 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=1657, Invalid=11006, Unknown=45, NotChecked=3042, Total=15750 [2023-11-06 22:06:43,827 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 706 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 3056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1548 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:43,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 207 Invalid, 3056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1117 Invalid, 0 Unknown, 1548 Unchecked, 1.6s Time] [2023-11-06 22:06:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-06 22:06:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2023-11-06 22:06:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.125) internal successors, (126), 112 states have internal predecessors, (126), 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 22:06:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2023-11-06 22:06:43,888 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 42 [2023-11-06 22:06:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:43,889 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2023-11-06 22:06:43,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.6027397260273972) internal successors, (117), 73 states have internal predecessors, (117), 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 22:06:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2023-11-06 22:06:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-06 22:06:43,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:43,890 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:43,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:44,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:44,098 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:44,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:44,098 INFO L85 PathProgramCache]: Analyzing trace with hash -170927737, now seen corresponding path program 7 times [2023-11-06 22:06:44,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:44,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390998425] [2023-11-06 22:06:44,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:44,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:44,453 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-06 22:06:44,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:44,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390998425] [2023-11-06 22:06:44,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390998425] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:06:44,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812910556] [2023-11-06 22:06:44,454 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 22:06:44,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:44,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:44,456 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:06:44,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:06:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:44,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:06:44,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-06 22:06:44,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:06:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-11-06 22:06:45,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812910556] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:06:45,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:06:45,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2023-11-06 22:06:45,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624634897] [2023-11-06 22:06:45,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:06:45,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 22:06:45,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:06:45,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 22:06:45,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:06:45,055 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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 22:06:45,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:06:45,723 INFO L93 Difference]: Finished difference Result 162 states and 172 transitions. [2023-11-06 22:06:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:06:45,724 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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 44 [2023-11-06 22:06:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:06:45,726 INFO L225 Difference]: With dead ends: 162 [2023-11-06 22:06:45,726 INFO L226 Difference]: Without dead ends: 122 [2023-11-06 22:06:45,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 74 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2023-11-06 22:06:45,728 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 150 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:06:45,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 117 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:06:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-06 22:06:45,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 90. [2023-11-06 22:06:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.0786516853932584) internal successors, (96), 89 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 22:06:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-11-06 22:06:45,773 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 44 [2023-11-06 22:06:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:06:45,774 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-11-06 22:06:45,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 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 22:06:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-11-06 22:06:45,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 22:06:45,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:06:45,775 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:06:45,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:06:45,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:06:45,978 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:06:45,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:06:45,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1104055129, now seen corresponding path program 3 times [2023-11-06 22:06:45,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:06:45,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416930755] [2023-11-06 22:06:45,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:06:45,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:06:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:06:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:06:50,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:06:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416930755] [2023-11-06 22:06:50,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416930755] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:06:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215260618] [2023-11-06 22:06:50,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:06:50,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:06:50,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:06:50,150 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:06:50,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:06:50,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-06 22:06:50,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:06:50,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-06 22:06:50,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:06:50,696 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:06:50,696 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 23 treesize of output 19 [2023-11-06 22:06:51,290 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2023-11-06 22:06:51,298 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 26 treesize of output 24 [2023-11-06 22:06:51,781 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 40 [2023-11-06 22:06:51,791 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-06 22:06:51,800 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 9 treesize of output 7 [2023-11-06 22:06:51,933 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2023-11-06 22:06:51,939 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2023-11-06 22:06:51,951 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 11 treesize of output 7 [2023-11-06 22:06:52,040 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 70 [2023-11-06 22:06:52,090 INFO L322 Elim1Store]: treesize reduction 24, result has 42.9 percent of original size [2023-11-06 22:06:52,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 72 [2023-11-06 22:06:59,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:59,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:59,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:06:59,648 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 115 treesize of output 101 [2023-11-06 22:06:59,658 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2023-11-06 22:06:59,667 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 63 treesize of output 59 [2023-11-06 22:06:59,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2023-11-06 22:06:59,685 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 46 treesize of output 44 [2023-11-06 22:06:59,737 INFO L322 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-06 22:06:59,738 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 24 [2023-11-06 22:06:59,750 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 11 treesize of output 7 [2023-11-06 22:07:00,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:07:00,094 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 40 treesize of output 40 [2023-11-06 22:07:00,114 INFO L322 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-11-06 22:07:00,114 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 17 [2023-11-06 22:07:00,271 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:07:00,272 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 48 [2023-11-06 22:07:00,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-11-06 22:07:00,293 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:07:00,294 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 27 treesize of output 25 [2023-11-06 22:07:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:07:01,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:07:09,478 INFO L322 Elim1Store]: treesize reduction 67, result has 41.2 percent of original size [2023-11-06 22:07:09,479 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 10084 treesize of output 9041 [2023-11-06 22:07:09,534 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:07:09,535 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 918 treesize of output 910 [2023-11-06 22:07:09,558 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 487 treesize of output 477 [2023-11-06 22:07:09,572 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 477 treesize of output 457 [2023-11-06 22:07:09,671 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:07:09,671 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1308 treesize of output 1168 [2023-11-06 22:07:09,801 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:07:09,802 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 864 treesize of output 774 [2023-11-06 22:07:09,925 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:07:09,926 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 25 treesize of output 24 [2023-11-06 22:07:10,596 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:07:10,597 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:07:10,657 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:07:10,657 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 174 treesize of output 203 [2023-11-06 22:07:13,118 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-06 22:07:13,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215260618] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:07:13,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:07:13,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 30] total 82 [2023-11-06 22:07:13,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371227751] [2023-11-06 22:07:13,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:07:13,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2023-11-06 22:07:13,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:07:13,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2023-11-06 22:07:13,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=5715, Unknown=193, NotChecked=0, Total=6642 [2023-11-06 22:07:13,124 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 82 states, 82 states have (on average 1.548780487804878) internal successors, (127), 82 states have internal predecessors, (127), 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 22:07:15,194 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse22 (* 4 c_~SIZE~0))) (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse16 (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse17 (* |c_ULTIMATE.start_main_~i~0#1| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 12) .cse22)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse5 (+ (- 4) .cse22 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (+ (- 4) .cse22 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse27 (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int) (|v_ULTIMATE.start_main_~tmp~0#1_59| Int) (|v_ULTIMATE.start_main_~i~0#1_214| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_214| 1) |v_ULTIMATE.start_main_~i~0#1_213|) (< 0 |v_ULTIMATE.start_main_~i~0#1_214|) (let ((.cse41 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse42 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_214| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_60|)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_213| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_59|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~b~0#1.base| .cse42) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 (select .cse42 .cse6)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1049))) (= (select (select .cse41 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse2) (select (select .cse41 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) (.cse26 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse15 (+ .cse17 |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse14 .cse5 (select .cse16 .cse6)))) (.cse28 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse7 (+ .cse17 |c_ULTIMATE.start_main_~b~0#1.offset|)) (.cse8 (< c_~SIZE~0 3))) (and (or (forall ((|v_ULTIMATE.start_main_~tmp~0#1_59| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1047 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) .cse7 |v_ULTIMATE.start_main_~tmp~0#1_59|))) (store (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 (select .cse4 .cse6))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1049))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse2)))) .cse8) (or (forall ((v_ArrVal_1049 (Array Int Int))) (let ((.cse9 (store .cse10 |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1049))) (= (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse9 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse2)))) .cse8) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int) (|v_ULTIMATE.start_main_~tmp~0#1_59| Int) (|v_ULTIMATE.start_main_~i~0#1_214| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1041 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_214| 1) |v_ULTIMATE.start_main_~i~0#1_213|) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse12 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse14 .cse15 (select .cse16 (+ .cse17 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse13 .cse5 (select v_ArrVal_1041 .cse6))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6 (select .cse13 .cse5)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_214| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_60|)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_213| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_59|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~b~0#1.base| .cse12) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 (select .cse12 .cse6)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1049))) (= (select (select .cse11 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse2) (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (< 0 |v_ULTIMATE.start_main_~i~0#1_214|))) .cse8) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int) (|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~tmp~0#1_59| Int) (|v_ULTIMATE.start_main_~i~0#1_214| Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1041 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_214| 1) |v_ULTIMATE.start_main_~i~0#1_213|) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse20 (+ |ULTIMATE.start_main_~b~0#1.offset| (- 4) .cse22))) (let ((.cse19 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse14 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse16 |ULTIMATE.start_main_~b~0#1.offset|))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select v_ArrVal_1038 (+ |ULTIMATE.start_main_~b~0#1.offset| 4)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse21 .cse5 (select v_ArrVal_1041 .cse20))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse20 (select .cse21 .cse5)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_214| 4)) |v_ULTIMATE.start_main_~tmp~0#1_60|)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_213| 4)) |v_ULTIMATE.start_main_~tmp~0#1_59|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~b~0#1.base| .cse19) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 (select .cse19 .cse20))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1049))) (= (select (select .cse18 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse18 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse2))) (< 0 |v_ULTIMATE.start_main_~i~0#1_214|))) .cse8) (or .cse8 (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int) (|v_ULTIMATE.start_main_~tmp~0#1_59| Int) (|v_ULTIMATE.start_main_~i~0#1_214| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1041 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_214| 1) |v_ULTIMATE.start_main_~i~0#1_213|) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse24 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse14 .cse26 (select .cse16 .cse7))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse25 .cse5 (select v_ArrVal_1041 .cse6))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse6 (select .cse25 .cse5)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_214| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_60|)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_213| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_59|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~b~0#1.base| .cse24) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 (select .cse24 .cse6)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1049))) (= (select (select .cse23 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse2) (select (select .cse23 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (< 0 |v_ULTIMATE.start_main_~i~0#1_214|)))) (or .cse8 .cse27 (< .cse28 c_~SIZE~0)) (or .cse8 .cse27) (or .cse8 (let ((.cse29 (= |c_ULTIMATE.start_main_~a_copy~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (and (or .cse29 (= 3 c_~SIZE~0)) (or (not .cse29) (= (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| .cse22) (+ 20 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or .cse29 (and (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a_copy~0#1.base|)) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))))))) (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse2) (select .cse14 .cse1)) .cse8) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (|v_ULTIMATE.start_main_~i~0#1_213| Int) (|v_ULTIMATE.start_main_~tmp~0#1_59| Int) (|v_ULTIMATE.start_main_~i~0#1_214| Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1041 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_214| 1) |v_ULTIMATE.start_main_~i~0#1_213|) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse32 (+ |ULTIMATE.start_main_~b~0#1.offset| (- 4) .cse22))) (let ((.cse31 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse14 .cse26 (select .cse16 (+ |ULTIMATE.start_main_~b~0#1.offset| .cse17)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_main_~a~0#1.base|) .cse15 (select v_ArrVal_1038 (+ |ULTIMATE.start_main_~b~0#1.offset| .cse17 4)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1041) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse33 .cse5 (select v_ArrVal_1041 .cse32))) |c_ULTIMATE.start_main_~b~0#1.base|) .cse32 (select .cse33 .cse5)))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_214| 4)) |v_ULTIMATE.start_main_~tmp~0#1_60|)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_213| 4)) |v_ULTIMATE.start_main_~tmp~0#1_59|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~b~0#1.base| .cse31) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 (select .cse31 .cse32))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1049))) (= (select (select .cse30 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse2) (select (select .cse30 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (< 0 |v_ULTIMATE.start_main_~i~0#1_214|))) .cse8) (or .cse8 (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int) (|v_ULTIMATE.start_main_~tmp~0#1_59| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1047 (Array Int Int))) (or (let ((.cse34 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047))) (let ((.cse36 (store (select .cse35 |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_213| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_59|))) (store (select (store .cse35 |c_ULTIMATE.start_main_~b~0#1.base| .cse36) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 (select .cse36 .cse6))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1049))) (= (select (select .cse34 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse34 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse2))) (< .cse28 |v_ULTIMATE.start_main_~i~0#1_213|)))) (or .cse8 (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int) (|v_ULTIMATE.start_main_~tmp~0#1_59| Int) (|v_ULTIMATE.start_main_~i~0#1_214| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_60| Int)) (or (< (+ |v_ULTIMATE.start_main_~i~0#1_214| 1) |v_ULTIMATE.start_main_~i~0#1_213|) (let ((.cse37 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse38 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~b~0#1.base|) .cse6 (select .cse14 .cse5))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_214| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_60|)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_213| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_59|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~b~0#1.base| .cse38) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 (select .cse38 .cse6)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1049))) (= (select (select .cse37 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse37 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse2))) (< 0 |v_ULTIMATE.start_main_~i~0#1_214|)))) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_213| Int) (|v_ULTIMATE.start_main_~tmp~0#1_59| Int) (v_ArrVal_1049 (Array Int Int)) (v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_60| Int)) (or (< .cse28 |v_ULTIMATE.start_main_~i~0#1_213|) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse40 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7 |v_ULTIMATE.start_main_~tmp~0#1_60|)) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_213| 4) |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_59|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_1047) |c_ULTIMATE.start_main_~b~0#1.base| .cse40) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 (select .cse40 .cse6)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_1049))) (= (select (select .cse39 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse39 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse2))))) .cse8))))) is different from true [2023-11-06 22:07:18,806 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 [0] [2023-11-06 22:07:20,868 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 [0] [2023-11-06 22:07:23,954 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 [0] [2023-11-06 22:07:26,043 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 [0] [2023-11-06 22:07:28,720 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 [0] [2023-11-06 22:07:37,086 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 [0, 1] [2023-11-06 22:07:39,435 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 [0] [2023-11-06 22:07:43,716 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 [0] [2023-11-06 22:07:48,040 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 [0] [2023-11-06 22:07:57,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 [0] [2023-11-06 22:08:04,023 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 [0] [2023-11-06 22:08:14,016 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 [0, 1] [2023-11-06 22:08:16,102 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 [0, 1] [2023-11-06 22:08:22,689 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 [0] [2023-11-06 22:08:24,722 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 [0] [2023-11-06 22:08:26,770 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 [0] [2023-11-06 22:08:29,544 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 [0] [2023-11-06 22:08:31,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:08:33,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:08:35,990 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 [0] [2023-11-06 22:08:38,347 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 [0, 1] [2023-11-06 22:08:40,353 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 [0, 1] [2023-11-06 22:08:42,421 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 [0, 1] [2023-11-06 22:08:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:45,548 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2023-11-06 22:08:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-11-06 22:08:45,549 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 82 states have (on average 1.548780487804878) internal successors, (127), 82 states have internal predecessors, (127), 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 46 [2023-11-06 22:08:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:45,550 INFO L225 Difference]: With dead ends: 98 [2023-11-06 22:08:45,550 INFO L226 Difference]: Without dead ends: 61 [2023-11-06 22:08:45,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4713 ImplicationChecksByTransitivity, 60.7s TimeCoverageRelationStatistics Valid=2330, Invalid=13681, Unknown=249, NotChecked=252, Total=16512 [2023-11-06 22:08:45,553 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 311 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 266 mSolverCounterUnsat, 62 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 62 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 50.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:45,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 237 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1262 Invalid, 62 Unknown, 80 Unchecked, 50.2s Time] [2023-11-06 22:08:45,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-06 22:08:45,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2023-11-06 22:08:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 54 states have internal predecessors, (60), 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 22:08:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2023-11-06 22:08:45,579 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 46 [2023-11-06 22:08:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:45,580 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2023-11-06 22:08:45,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 1.548780487804878) internal successors, (127), 82 states have internal predecessors, (127), 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 22:08:45,580 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2023-11-06 22:08:45,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-06 22:08:45,580 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:45,580 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:45,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c636404b-5fe4-4e95-9740-37713f8d276e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0