./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/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_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3bd2edbf3e593c12fc0be33924c944159e0cb6d32e04e77d638ccd9d0e66fc4a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:54:58,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:54:59,047 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-06 22:54:59,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:54:59,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:54:59,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:54:59,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:54:59,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:54:59,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:54:59,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:54:59,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:54:59,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:54:59,105 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:54:59,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:54:59,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:54:59,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:54:59,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:54:59,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:54:59,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:54:59,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:54:59,127 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 22:54:59,128 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:54:59,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:54:59,129 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:54:59,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:54:59,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:54:59,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:54:59,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:54:59,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:54:59,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:54:59,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:54:59,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:54:59,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:54:59,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:54:59,134 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:54:59,134 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:54:59,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:54:59,134 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:54:59,135 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_9b7592a5-778e-4c14-8628-faf161fde63f/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_9b7592a5-778e-4c14-8628-faf161fde63f/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bd2edbf3e593c12fc0be33924c944159e0cb6d32e04e77d638ccd9d0e66fc4a [2023-11-06 22:54:59,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:54:59,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:54:59,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:54:59,442 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:54:59,443 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:54:59,444 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2023-11-06 22:55:02,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:55:02,976 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:55:02,977 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2023-11-06 22:55:02,991 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/data/428bde78c/b6ecaa4dff204d5b9e49f358d51bf5b9/FLAG41f00ddd3 [2023-11-06 22:55:03,007 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/data/428bde78c/b6ecaa4dff204d5b9e49f358d51bf5b9 [2023-11-06 22:55:03,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:55:03,011 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:55:03,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:55:03,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:55:03,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:55:03,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:55:03" (1/1) ... [2023-11-06 22:55:03,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35291e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:03, skipping insertion in model container [2023-11-06 22:55:03,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:55:03" (1/1) ... [2023-11-06 22:55:03,092 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:55:03,382 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:55:03,395 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:55:03,455 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:55:03,494 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:55:03,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:03 WrapperNode [2023-11-06 22:55:03,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:55:03,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:55:03,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:55:03,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:55:03,504 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:55:03" (1/1) ... [2023-11-06 22:55:03,517 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:55:03" (1/1) ... [2023-11-06 22:55:03,541 INFO L138 Inliner]: procedures = 111, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2023-11-06 22:55:03,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:55:03,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:55:03,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:55:03,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:55:03,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:03" (1/1) ... [2023-11-06 22:55:03,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:03" (1/1) ... [2023-11-06 22:55:03,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:03" (1/1) ... [2023-11-06 22:55:03,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:03" (1/1) ... [2023-11-06 22:55:03,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:03" (1/1) ... [2023-11-06 22:55:03,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:03" (1/1) ... [2023-11-06 22:55:03,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:03" (1/1) ... [2023-11-06 22:55:03,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:03" (1/1) ... [2023-11-06 22:55:03,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:55:03,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:55:03,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:55:03,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:55:03,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:03" (1/1) ... [2023-11-06 22:55:03,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:55:03,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:55:03,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/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:55:03,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/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:55:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:55:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:55:03,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:55:03,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:55:03,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:55:03,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:55:03,819 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:55:03,822 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:55:04,045 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:55:04,051 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:55:04,052 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:55:04,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:55:04 BoogieIcfgContainer [2023-11-06 22:55:04,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:55:04,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:55:04,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:55:04,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:55:04,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:55:03" (1/3) ... [2023-11-06 22:55:04,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ab567f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:55:04, skipping insertion in model container [2023-11-06 22:55:04,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:55:03" (2/3) ... [2023-11-06 22:55:04,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ab567f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:55:04, skipping insertion in model container [2023-11-06 22:55:04,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:55:04" (3/3) ... [2023-11-06 22:55:04,076 INFO L112 eAbstractionObserver]: Analyzing ICFG b.14-alloca.i [2023-11-06 22:55:04,098 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:55:04,098 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-06 22:55:04,149 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:55:04,158 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;@1e867ecc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:55:04,158 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 22:55:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 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:55:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-06 22:55:04,172 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:04,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:04,173 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 22:55:04,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:04,180 INFO L85 PathProgramCache]: Analyzing trace with hash 177751404, now seen corresponding path program 1 times [2023-11-06 22:55:04,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:04,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325201873] [2023-11-06 22:55:04,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:04,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:04,693 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:55:04,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:04,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325201873] [2023-11-06 22:55:04,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325201873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:04,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:04,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:55:04,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436726266] [2023-11-06 22:55:04,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:04,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:55:04,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:04,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:55:04,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:55:04,757 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 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 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:55:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:04,915 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2023-11-06 22:55:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:55:04,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2023-11-06 22:55:04,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:04,931 INFO L225 Difference]: With dead ends: 56 [2023-11-06 22:55:04,931 INFO L226 Difference]: Without dead ends: 27 [2023-11-06 22:55:04,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:55:04,945 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:04,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 69 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:55:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-06 22:55:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2023-11-06 22:55:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 21 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:55:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-06 22:55:04,984 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 8 [2023-11-06 22:55:04,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:04,985 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-06 22:55:04,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:55:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-06 22:55:04,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 22:55:04,986 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:04,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:04,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:55:04,987 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 22:55:04,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1215326290, now seen corresponding path program 1 times [2023-11-06 22:55:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:04,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013985053] [2023-11-06 22:55:04,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:04,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:05,454 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:55:05,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:05,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013985053] [2023-11-06 22:55:05,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013985053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:05,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:05,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:55:05,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101181196] [2023-11-06 22:55:05,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:05,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:55:05,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:05,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:55:05,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:55:05,459 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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:55:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:05,581 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2023-11-06 22:55:05,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:55:05,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2023-11-06 22:55:05,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:05,583 INFO L225 Difference]: With dead ends: 22 [2023-11-06 22:55:05,583 INFO L226 Difference]: Without dead ends: 21 [2023-11-06 22:55:05,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:55:05,587 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 40 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:05,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 20 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:55:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-06 22:55:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-06 22:55:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.5) internal successors, (24), 20 states have internal predecessors, (24), 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:55:05,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-11-06 22:55:05,595 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 9 [2023-11-06 22:55:05,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:05,596 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-11-06 22:55:05,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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:55:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-11-06 22:55:05,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:55:05,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:05,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:05,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:55:05,599 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 22:55:05,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash -979590610, now seen corresponding path program 1 times [2023-11-06 22:55:05,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:05,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950706292] [2023-11-06 22:55:05,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:05,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:05,883 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:55:05,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:05,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950706292] [2023-11-06 22:55:05,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950706292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:05,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:05,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:55:05,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75890657] [2023-11-06 22:55:05,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:05,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:55:05,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:05,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:55:05,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:55:05,886 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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:55:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:05,993 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2023-11-06 22:55:05,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:55:05,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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 10 [2023-11-06 22:55:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:05,994 INFO L225 Difference]: With dead ends: 29 [2023-11-06 22:55:05,994 INFO L226 Difference]: Without dead ends: 28 [2023-11-06 22:55:05,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:55:05,996 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:05,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 36 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:55:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-06 22:55:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2023-11-06 22:55:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 22 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:55:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-11-06 22:55:06,003 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 10 [2023-11-06 22:55:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:06,003 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-11-06 22:55:06,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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:55:06,004 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-11-06 22:55:06,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:55:06,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:06,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:06,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:55:06,005 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 22:55:06,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:06,006 INFO L85 PathProgramCache]: Analyzing trace with hash -302537772, now seen corresponding path program 1 times [2023-11-06 22:55:06,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:06,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132106090] [2023-11-06 22:55:06,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:06,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:06,207 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:55:06,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:06,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132106090] [2023-11-06 22:55:06,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132106090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:06,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:06,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:55:06,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231777993] [2023-11-06 22:55:06,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:06,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:55:06,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:06,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:55:06,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:55:06,210 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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:55:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:06,328 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-11-06 22:55:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:55:06,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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 11 [2023-11-06 22:55:06,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:06,329 INFO L225 Difference]: With dead ends: 28 [2023-11-06 22:55:06,330 INFO L226 Difference]: Without dead ends: 27 [2023-11-06 22:55:06,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:55:06,331 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:06,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 43 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:55:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-06 22:55:06,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2023-11-06 22:55:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:55:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-11-06 22:55:06,338 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 11 [2023-11-06 22:55:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:06,338 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-11-06 22:55:06,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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:55:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-11-06 22:55:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:55:06,339 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:06,339 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:06,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:55:06,340 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 22:55:06,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:06,340 INFO L85 PathProgramCache]: Analyzing trace with hash -788736272, now seen corresponding path program 1 times [2023-11-06 22:55:06,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:06,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016468545] [2023-11-06 22:55:06,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:06,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:06,625 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:55:06,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:06,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016468545] [2023-11-06 22:55:06,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016468545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:55:06,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:55:06,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:55:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185993987] [2023-11-06 22:55:06,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:55:06,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:55:06,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:06,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:55:06,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:55:06,628 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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:55:06,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:55:06,708 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2023-11-06 22:55:06,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:55:06,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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 12 [2023-11-06 22:55:06,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:55:06,710 INFO L225 Difference]: With dead ends: 37 [2023-11-06 22:55:06,711 INFO L226 Difference]: Without dead ends: 35 [2023-11-06 22:55:06,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:55:06,715 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:55:06,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:55:06,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-06 22:55:06,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-06 22:55:06,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 34 states have internal predecessors, (40), 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:55:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-11-06 22:55:06,733 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 12 [2023-11-06 22:55:06,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:55:06,733 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-11-06 22:55:06,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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:55:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-11-06 22:55:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:55:06,735 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:55:06,735 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:55:06,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:55:06,735 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 22:55:06,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:55:06,736 INFO L85 PathProgramCache]: Analyzing trace with hash -940015839, now seen corresponding path program 1 times [2023-11-06 22:55:06,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:55:06,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411366931] [2023-11-06 22:55:06,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:06,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:55:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:55:07,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:55:07,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411366931] [2023-11-06 22:55:07,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411366931] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:55:07,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630565001] [2023-11-06 22:55:07,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:55:07,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:55:07,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:55:07,240 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:55:07,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:55:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:55:07,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-06 22:55:07,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:55:07,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-06 22:55:07,454 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:55:07,480 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-06 22:55:07,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 53 treesize of output 54 [2023-11-06 22:55:07,510 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 29 [2023-11-06 22:55:07,516 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:55:07,534 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 22:55:07,547 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:55:07,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2023-11-06 22:55:07,556 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:55:07,557 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:55:07,558 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2023-11-06 22:55:07,570 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:55:07,578 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 22:55:07,596 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 30 treesize of output 1 [2023-11-06 22:55:07,629 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 22:55:07,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 22:55:07,660 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 30 treesize of output 1 [2023-11-06 22:55:08,954 INFO L322 Elim1Store]: treesize reduction 50, result has 35.1 percent of original size [2023-11-06 22:55:08,955 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1868 treesize of output 1545 [2023-11-06 22:55:09,004 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 29 treesize of output 13 [2023-11-06 22:55:09,033 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:55:09,049 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2023-11-06 22:55:09,066 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:55:09,174 INFO L322 Elim1Store]: treesize reduction 24, result has 44.2 percent of original size [2023-11-06 22:55:09,175 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2023-11-06 22:55:09,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-11-06 22:55:09,290 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:55:13,414 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:55:13,415 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 33 treesize of output 25 [2023-11-06 22:55:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:55:13,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:55:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:55:14,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630565001] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:55:14,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:55:14,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 25 [2023-11-06 22:55:14,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235639132] [2023-11-06 22:55:14,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:55:14,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 22:55:14,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:55:14,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 22:55:14,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=486, Unknown=35, NotChecked=0, Total=650 [2023-11-06 22:55:14,171 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 26 states, 25 states have (on average 1.8) internal successors, (45), 26 states have internal predecessors, (45), 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:55:16,736 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:55:20,829 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:55:33,126 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:55:33,139 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (select .cse7 0))) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse9 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse8 (<= .cse6 0)) (.cse13 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (not .cse4)) (.cse1 (not .cse13)) (.cse3 (or (and (not .cse9) .cse8) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_test_fun_~y#1| Int)) (= .cse7 (store (select (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_2))) (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|))) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse6))) .cse8))) (.cse10 (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse12 0 |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse6) .cse7) (= .cse12 v_DerPreprocessor_8)))) .cse13 .cse8)) (.cse11 (select .cse0 0))) (and (<= 1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse1 (or (and .cse1 .cse2 .cse3) (and .cse4 (or (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_7))) (and (= v_DerPreprocessor_6 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse6) .cse7)))) .cse8) (and .cse9 .cse8))) .cse10) .cse2 (<= 1 .cse11) (or (and .cse1 .cse3) .cse10) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (or (< 0 .cse11) (not |c_ULTIMATE.start_test_fun_#t~short8#1|))))))) is different from true [2023-11-06 22:55:35,145 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:55:43,232 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:55:45,262 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:55:51,366 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:55:53,384 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:55:55,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:55:57,124 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:55:59,134 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:56:01,165 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:56:03,239 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:56:07,515 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:56:09,543 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:56:11,554 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:56:15,684 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (select .cse7 0)) (.cse2 (select .cse0 0)) (.cse10 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse13 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (not .cse13)) (.cse4 (not .cse10)) (.cse1 (<= 0 .cse2)) (.cse6 (<= .cse9 0))) (and (<= 1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (or (and (exists ((|ULTIMATE.start_test_fun_~y_ref~0#1.base| Int)) (<= |c_ULTIMATE.start_test_fun_#t~mem9#1| (select (select |c_#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0))) .cse1) (< |c_ULTIMATE.start_test_fun_#t~mem9#1| (+ 1 .cse2))) .cse3 (let ((.cse5 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (and .cse3 .cse4 (or (and (not .cse5) .cse6) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int)) (|ULTIMATE.start_test_fun_~y#1| Int)) (= .cse7 (store (select (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_1) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_2))) (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|))) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse9))) .cse6))) (and .cse10 (or (and (exists ((v_DerPreprocessor_5 (Array Int Int)) (|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_7 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_5) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_7))) (and (= v_DerPreprocessor_6 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_6) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_7) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse9) .cse7)))) .cse6) (and .cse5 .cse6))) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_8 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_9) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_10) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse12 0 |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse9) .cse7) (= .cse12 v_DerPreprocessor_8)))) .cse13 .cse6))) .cse4 .cse1 .cse6 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (or (< 0 .cse2) (not |c_ULTIMATE.start_test_fun_#t~short8#1|)))))) is different from true [2023-11-06 22:56:36,570 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (or (< 0 (+ .cse0 2147483648)) (< (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)) (or (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_109 Int) (v_ArrVal_112 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_109)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_112))) (or (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_109 1) .cse0) (< 0 (+ (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648))))) (< .cse0 1)) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_112))) (or (< 0 (+ (select (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (select (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))))))) is different from false [2023-11-06 22:56:37,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:56:37,105 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2023-11-06 22:56:37,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-06 22:56:37,107 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 26 states have internal predecessors, (45), 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:56:37,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:56:37,110 INFO L225 Difference]: With dead ends: 134 [2023-11-06 22:56:37,110 INFO L226 Difference]: Without dead ends: 133 [2023-11-06 22:56:37,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 55.3s TimeCoverageRelationStatistics Valid=676, Invalid=1879, Unknown=109, NotChecked=306, Total=2970 [2023-11-06 22:56:37,113 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 160 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 27 mSolverCounterUnsat, 66 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 66 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:56:37,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 218 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 306 Invalid, 66 Unknown, 136 Unchecked, 32.7s Time] [2023-11-06 22:56:37,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-06 22:56:37,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 81. [2023-11-06 22:56:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.355263157894737) internal successors, (103), 80 states have internal predecessors, (103), 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:56:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2023-11-06 22:56:37,151 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 16 [2023-11-06 22:56:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:56:37,152 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2023-11-06 22:56:37,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.8) internal successors, (45), 26 states have internal predecessors, (45), 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:56:37,152 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2023-11-06 22:56:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:56:37,154 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:56:37,154 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:37,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:56:37,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-06 22:56:37,360 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 22:56:37,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:37,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1412087133, now seen corresponding path program 1 times [2023-11-06 22:56:37,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:37,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595188962] [2023-11-06 22:56:37,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:37,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:56:37,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:37,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595188962] [2023-11-06 22:56:37,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595188962] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:56:37,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448485699] [2023-11-06 22:56:37,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:37,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:56:37,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:56:37,606 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:56:37,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:56:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:37,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:56:37,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:56:37,875 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:56:37,875 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 37 treesize of output 33 [2023-11-06 22:56:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:56:37,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:56:38,033 INFO L322 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-06 22:56:38,033 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 48 treesize of output 1 [2023-11-06 22:56:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:56:38,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448485699] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 22:56:38,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:56:38,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 12 [2023-11-06 22:56:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111145951] [2023-11-06 22:56:38,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:56:38,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:56:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:38,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:56:38,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:56:38,037 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:56:38,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:56:38,170 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2023-11-06 22:56:38,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:56:38,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2023-11-06 22:56:38,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:56:38,174 INFO L225 Difference]: With dead ends: 81 [2023-11-06 22:56:38,174 INFO L226 Difference]: Without dead ends: 80 [2023-11-06 22:56:38,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:56:38,176 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:56:38,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:56:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-06 22:56:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-06 22:56:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 79 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:56:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2023-11-06 22:56:38,193 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 18 [2023-11-06 22:56:38,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:56:38,194 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2023-11-06 22:56:38,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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:56:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2023-11-06 22:56:38,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 22:56:38,196 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:56:38,196 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:38,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:56:38,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:56:38,402 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 22:56:38,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:38,403 INFO L85 PathProgramCache]: Analyzing trace with hash -825028097, now seen corresponding path program 1 times [2023-11-06 22:56:38,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:38,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33780647] [2023-11-06 22:56:38,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:38,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:39,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:39,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33780647] [2023-11-06 22:56:39,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33780647] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:56:39,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132089439] [2023-11-06 22:56:39,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:39,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:56:39,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:56:39,025 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:56:39,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:56:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:39,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-06 22:56:39,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:56:39,244 INFO L322 Elim1Store]: treesize reduction 80, result has 38.0 percent of original size [2023-11-06 22:56:39,245 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 97 [2023-11-06 22:56:39,257 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2023-11-06 22:56:39,285 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 10 treesize of output 9 [2023-11-06 22:56:39,311 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 10 treesize of output 9 [2023-11-06 22:56:39,410 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 30 treesize of output 26 [2023-11-06 22:56:39,689 INFO L322 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-06 22:56:39,690 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 33 [2023-11-06 22:56:39,698 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 15 treesize of output 11 [2023-11-06 22:56:39,725 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 42 treesize of output 38 [2023-11-06 22:56:40,480 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse4 0)) (.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0))) (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= |c_ULTIMATE.start_test_fun_#t~mem10#1| .cse0) (<= .cse0 .cse1) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (let ((.cse7 (<= .cse1 2147483647))) (or (and (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse5))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) (store .cse3 0 .cse1)) (= .cse3 v_DerPreprocessor_12) (= .cse3 .cse4))))) (and (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse5))) (and (= (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_12) (= (select (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) .cse1))))))) .cse7) (and .cse7 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from true [2023-11-06 22:56:40,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:40,752 INFO L322 Elim1Store]: treesize reduction 34, result has 50.7 percent of original size [2023-11-06 22:56:40,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 338 treesize of output 321 [2023-11-06 22:56:40,803 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 182 treesize of output 180 [2023-11-06 22:56:40,949 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 31 treesize of output 15 [2023-11-06 22:56:40,964 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 29 treesize of output 13 [2023-11-06 22:56:41,186 INFO L322 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-06 22:56:41,187 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 46 [2023-11-06 22:56:41,412 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-06 22:56:41,413 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2023-11-06 22:56:41,741 INFO L322 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-11-06 22:56:41,742 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 41 [2023-11-06 22:56:41,758 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:56:41,759 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 28 treesize of output 24 [2023-11-06 22:56:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 22:56:41,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:56:42,367 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_204 (Array Int Int)) (v_ArrVal_201 Int) (|v_ULTIMATE.start_test_fun_#t~mem11#1_14| Int) (v_ArrVal_206 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_201)))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse2 (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) |v_ULTIMATE.start_test_fun_#t~mem11#1_14|)))) (let ((.cse0 (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| .cse2) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_204) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_206 1)) (< 2147483648 |v_ULTIMATE.start_test_fun_#t~mem11#1_14|) (< |c_ULTIMATE.start_test_fun_#t~mem10#1| (+ v_ArrVal_201 1)) (< (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem11#1_14|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| .cse2) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_204) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_206)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483649))))))) is different from false [2023-11-06 22:56:42,471 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_204 (Array Int Int)) (v_ArrVal_201 Int) (|v_ULTIMATE.start_test_fun_#t~mem11#1_14| Int) (v_ArrVal_206 Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_201)))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse3 (store .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) |v_ULTIMATE.start_test_fun_#t~mem11#1_14|)))) (let ((.cse0 (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| .cse3) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_204) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_206 1)) (< 2147483648 |v_ULTIMATE.start_test_fun_#t~mem11#1_14|) (< (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_201 1)) (< (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem11#1_14|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| .cse3) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_204) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_206)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483649)))))))) is different from false [2023-11-06 22:56:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-06 22:56:43,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132089439] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:56:43,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:56:43,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 25 [2023-11-06 22:56:43,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892163368] [2023-11-06 22:56:43,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:56:43,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 22:56:43,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:43,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 22:56:43,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=391, Unknown=18, NotChecked=132, Total=650 [2023-11-06 22:56:43,088 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 26 states, 25 states have (on average 2.12) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:43,126 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (not .cse0) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (let ((.cse3 (select .cse7 0))) (let ((.cse6 (<= .cse3 2147483647))) (or (and (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse4))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) (store .cse2 0 .cse3)) (= .cse2 v_DerPreprocessor_12) (= .cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)))))) (and (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse4))) (and (= (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_12) (= (select (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) .cse3))))))) .cse6) (and .cse6 .cse0)))) (<= (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483647) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from true [2023-11-06 22:56:43,136 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse0 (not |c_ULTIMATE.start_test_fun_#t~short8#1|)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse5 (select .cse2 0))) (and (or .cse0 (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= .cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (not .cse3) (<= .cse1 2147483647)))) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (or (< (select .cse4 0) (+ .cse5 1)) .cse0) (let ((.cse10 (<= .cse5 2147483647))) (or (and (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) (store .cse7 0 .cse5)) (= .cse7 v_DerPreprocessor_12) (= .cse7 .cse4))))) (and (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8))) (and (= (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_12) (= (select (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) .cse5))))))) .cse10) (and .cse10 .cse3))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from true [2023-11-06 22:56:44,470 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse11 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (not .cse11)) (.cse4 (select .cse3 0)) (.cse5 (select .cse16 0)) (.cse1 (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (or (not |c_ULTIMATE.start_test_fun_#t~short8#1|) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (= .cse0 .cse1) .cse2 (<= .cse0 2147483647)))) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= |c_ULTIMATE.start_test_fun_#t~mem10#1| .cse4) .cse2 (<= .cse4 .cse5) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (let ((.cse10 (<= .cse5 2147483647))) (or (and (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (= (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) (store .cse7 0 .cse5)) (= .cse7 v_DerPreprocessor_12) (= .cse7 .cse3))))) (and (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|) (exists ((v_DerPreprocessor_12 (Array Int Int)) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_12) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse8))) (and (= (select .cse9 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_12) (= (select (select .cse9 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) .cse5))))))) .cse10) (and .cse10 .cse11))) (forall ((v_ArrVal_204 (Array Int Int)) (v_ArrVal_201 Int) (|v_ULTIMATE.start_test_fun_#t~mem11#1_14| Int) (v_ArrVal_206 Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_201)))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse14 (store .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) |v_ULTIMATE.start_test_fun_#t~mem11#1_14|)))) (let ((.cse12 (select (store (store .cse15 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| .cse14) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_204) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (< (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_206 1)) (< 2147483648 |v_ULTIMATE.start_test_fun_#t~mem11#1_14|) (< |c_ULTIMATE.start_test_fun_#t~mem10#1| (+ v_ArrVal_201 1)) (< (select .cse13 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem11#1_14|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| .cse14) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_204) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_206)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483649))))))) (<= .cse1 2147483647) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from true [2023-11-06 22:56:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:56:46,463 INFO L93 Difference]: Finished difference Result 181 states and 229 transitions. [2023-11-06 22:56:46,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-06 22:56:46,464 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-06 22:56:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:56:46,466 INFO L225 Difference]: With dead ends: 181 [2023-11-06 22:56:46,466 INFO L226 Difference]: Without dead ends: 180 [2023-11-06 22:56:46,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=435, Invalid=1401, Unknown=80, NotChecked=534, Total=2450 [2023-11-06 22:56:46,469 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 102 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 26 mSolverCounterUnsat, 105 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 105 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:56:46,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 155 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 410 Invalid, 105 Unknown, 312 Unchecked, 1.3s Time] [2023-11-06 22:56:46,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-06 22:56:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 73. [2023-11-06 22:56:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 72 states have internal predecessors, (92), 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:56:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2023-11-06 22:56:46,497 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 19 [2023-11-06 22:56:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:56:46,498 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2023-11-06 22:56:46,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.12) internal successors, (53), 26 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:56:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2023-11-06 22:56:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-06 22:56:46,500 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:56:46,500 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:46,513 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:56:46,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:56:46,709 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 22:56:46,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:46,710 INFO L85 PathProgramCache]: Analyzing trace with hash 193932837, now seen corresponding path program 1 times [2023-11-06 22:56:46,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:46,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926626382] [2023-11-06 22:56:46,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:46,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:47,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:47,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926626382] [2023-11-06 22:56:47,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926626382] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:56:47,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014824546] [2023-11-06 22:56:47,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:47,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:56:47,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:56:47,391 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:56:47,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:56:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:47,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-06 22:56:47,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:56:47,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 22:56:47,565 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 30 treesize of output 1 [2023-11-06 22:56:47,590 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 22:56:47,603 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 24 treesize of output 1 [2023-11-06 22:56:47,635 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-06 22:56:47,652 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:56:47,671 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-06 22:56:47,688 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 53 treesize of output 54 [2023-11-06 22:56:47,700 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 29 [2023-11-06 22:56:47,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:56:47,722 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 22:56:47,738 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 30 treesize of output 1 [2023-11-06 22:56:47,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 22:56:47,785 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 24 treesize of output 1 [2023-11-06 22:56:47,829 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:56:48,852 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-06 22:56:48,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 18 [2023-11-06 22:56:48,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:56:49,121 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-06 22:56:49,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:49,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2023-11-06 22:56:49,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:49,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:56:51,550 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:56:51,550 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 25 treesize of output 26 [2023-11-06 22:56:51,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 140 treesize of output 128 [2023-11-06 22:56:51,576 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 7 treesize of output 5 [2023-11-06 22:56:51,584 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 24 treesize of output 20 [2023-11-06 22:56:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:52,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014824546] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:56:52,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:56:52,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 10] total 28 [2023-11-06 22:56:52,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287219465] [2023-11-06 22:56:52,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:56:52,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-06 22:56:52,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:52,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-06 22:56:52,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=653, Unknown=23, NotChecked=0, Total=812 [2023-11-06 22:56:52,102 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 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:56:52,422 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select .cse4 0)) (.cse6 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0)) (.cse2 (not .cse6)) (.cse3 (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (.cse5 (<= .cse1 0))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0)) (<= 0 (+ 2147483648 .cse1)) .cse2 (<= 1 .cse0) .cse3 (= (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) .cse5 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (or (and .cse6 .cse5 (exists ((|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_15) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_17))) (and (= .cse4 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse1)) (= v_DerPreprocessor_16 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|)))))) (and .cse2 (or (and .cse3 .cse5) (and (exists ((v_DerPreprocessor_20 (Array Int Int)) (v_DerPreprocessor_21 (Array Int Int)) (|ULTIMATE.start_test_fun_~y#1| Int)) (= (store (select (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_20) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_21))) (store .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|))) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse1) .cse4)) .cse5)))))))) is different from true [2023-11-06 22:56:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:56:52,887 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2023-11-06 22:56:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:56:52,889 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 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 20 [2023-11-06 22:56:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:56:52,889 INFO L225 Difference]: With dead ends: 127 [2023-11-06 22:56:52,889 INFO L226 Difference]: Without dead ends: 55 [2023-11-06 22:56:52,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=348, Invalid=1192, Unknown=24, NotChecked=76, Total=1640 [2023-11-06 22:56:52,891 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:56:52,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 93 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 225 Invalid, 0 Unknown, 22 Unchecked, 0.3s Time] [2023-11-06 22:56:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-06 22:56:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2023-11-06 22:56:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 49 states have internal predecessors, (58), 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:56:52,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2023-11-06 22:56:52,910 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 20 [2023-11-06 22:56:52,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:56:52,911 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2023-11-06 22:56:52,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 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:56:52,911 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2023-11-06 22:56:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-06 22:56:52,913 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:56:52,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:56:52,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:56:53,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:56:53,119 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 22:56:53,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:56:53,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1716950721, now seen corresponding path program 1 times [2023-11-06 22:56:53,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:56:53,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996135344] [2023-11-06 22:56:53,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:53,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:56:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:53,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:56:53,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996135344] [2023-11-06 22:56:53,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996135344] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:56:53,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825625318] [2023-11-06 22:56:53,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:56:53,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:56:53,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:56:53,649 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:56:53,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:56:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:56:53,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-06 22:56:53,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:56:53,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 10 treesize of output 8 [2023-11-06 22:56:53,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-06 22:56:53,830 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:56:53,849 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-06 22:56:53,882 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:56:53,910 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 22:56:53,926 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 30 treesize of output 1 [2023-11-06 22:56:53,944 WARN L193 Elim1Store]: Array PQE input equivalent to false [2023-11-06 22:56:54,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:54,880 INFO L322 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2023-11-06 22:56:54,880 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 288 treesize of output 238 [2023-11-06 22:56:54,893 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:56:54,900 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:56:54,905 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 15 treesize of output 11 [2023-11-06 22:56:55,038 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:56:55,039 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 20 [2023-11-06 22:56:55,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-06 22:56:55,254 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:56:55,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:56:55,333 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-11-06 22:56:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:56:55,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:56:55,388 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_313 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_313) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2023-11-06 22:56:55,409 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_313 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_313) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2023-11-06 22:56:55,434 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_313 (Array Int Int)) (v_ArrVal_312 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |c_ULTIMATE.start_test_fun_#t~mem12#1| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_312) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_313) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2023-11-06 22:56:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-06 22:56:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825625318] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:56:56,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:56:56,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 10] total 26 [2023-11-06 22:56:56,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707286608] [2023-11-06 22:56:56,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:56:56,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-06 22:56:56,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:56:56,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-06 22:56:56,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=410, Unknown=18, NotChecked=138, Total=702 [2023-11-06 22:56:56,023 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 27 states have internal predecessors, (59), 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:57:01,441 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 [1] [2023-11-06 22:57:01,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:57:01,604 INFO L93 Difference]: Finished difference Result 137 states and 163 transitions. [2023-11-06 22:57:01,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:57:01,605 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 27 states have internal predecessors, (59), 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 21 [2023-11-06 22:57:01,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:57:01,606 INFO L225 Difference]: With dead ends: 137 [2023-11-06 22:57:01,607 INFO L226 Difference]: Without dead ends: 136 [2023-11-06 22:57:01,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=369, Invalid=926, Unknown=49, NotChecked=216, Total=1560 [2023-11-06 22:57:01,609 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 93 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 26 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:57:01,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 100 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 174 Invalid, 37 Unknown, 454 Unchecked, 2.7s Time] [2023-11-06 22:57:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-06 22:57:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2023-11-06 22:57:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 124 states have (on average 1.1774193548387097) internal successors, (146), 125 states have internal predecessors, (146), 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:57:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2023-11-06 22:57:01,640 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 21 [2023-11-06 22:57:01,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:57:01,641 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2023-11-06 22:57:01,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 27 states have internal predecessors, (59), 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:57:01,641 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2023-11-06 22:57:01,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-06 22:57:01,643 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:57:01,643 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:01,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:57:01,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 22:57:01,852 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 22:57:01,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:01,853 INFO L85 PathProgramCache]: Analyzing trace with hash 240804747, now seen corresponding path program 2 times [2023-11-06 22:57:01,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:01,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121528168] [2023-11-06 22:57:01,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:01,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:02,843 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:57:02,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:02,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121528168] [2023-11-06 22:57:02,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121528168] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:57:02,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822146036] [2023-11-06 22:57:02,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:57:02,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:57:02,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:57:02,846 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:57:02,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:57:02,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:57:02,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:57:02,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-06 22:57:02,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:57:03,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 14 treesize of output 12 [2023-11-06 22:57:03,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-06 22:57:03,298 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:57:03,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-06 22:57:03,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-06 22:57:03,490 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2023-11-06 22:57:03,603 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:57:03,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2023-11-06 22:57:03,675 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-06 22:57:03,816 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2023-11-06 22:57:03,915 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:57:03,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2023-11-06 22:57:03,951 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-06 22:57:04,047 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:57:04,048 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 35 treesize of output 27 [2023-11-06 22:57:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:57:04,059 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:57:05,452 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_382 (Array Int Int)) (v_ArrVal_384 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_380 Int) (v_ArrVal_386 (Array Int Int)) (|ULTIMATE.start_test_fun_~y_ref~0#1.base| Int) (v_ArrVal_387 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_378) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_380)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_383) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_384)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_387))) (or (< (+ v_ArrVal_384 1) (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_380 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (select (select .cse1 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1)))))) is different from false [2023-11-06 22:57:05,539 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_384 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_380 Int) (v_ArrVal_386 (Array Int Int)) (|ULTIMATE.start_test_fun_~y_ref~0#1.base| Int) (v_ArrVal_387 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_376)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_378) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_380)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_383) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_384)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_387))) (or (< (select (select .cse0 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_376 1) |c_ULTIMATE.start_test_fun_#t~mem10#1|) (< (+ v_ArrVal_384 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_380 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))))))) is different from false [2023-11-06 22:57:05,650 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 Int) (v_ArrVal_382 (Array Int Int)) (v_ArrVal_384 Int) (v_ArrVal_383 (Array Int Int)) (v_ArrVal_380 Int) (v_ArrVal_386 (Array Int Int)) (|ULTIMATE.start_test_fun_~y_ref~0#1.base| Int) (v_ArrVal_387 (Array Int Int)) (v_ArrVal_379 (Array Int Int)) (v_ArrVal_378 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_376)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_378) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_379) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_380)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_382) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_383) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_384)) |ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_386) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_387))) (or (< (select (select .cse0 |ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< (+ v_ArrVal_376 1) (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< (+ v_ArrVal_384 1) (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (< 0 (+ (select (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 2147483648)) (< (+ v_ArrVal_380 1) (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))))))) is different from false [2023-11-06 22:57:05,932 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:57:05,933 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 655 treesize of output 647 [2023-11-06 22:57:05,972 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 137 treesize of output 125 [2023-11-06 22:57:05,992 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 28 treesize of output 26 [2023-11-06 22:57:06,010 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 54 treesize of output 50 [2023-11-06 22:57:06,029 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 27 treesize of output 25 [2023-11-06 22:57:06,055 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:57:06,056 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 165 treesize of output 161 [2023-11-06 22:57:06,081 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 28 treesize of output 24 [2023-11-06 22:57:06,115 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:57:06,116 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 128 treesize of output 126 [2023-11-06 22:57:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 8 refuted. 10 times theorem prover too weak. 0 trivial. 15 not checked. [2023-11-06 22:57:06,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822146036] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:57:06,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:57:06,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 18] total 42 [2023-11-06 22:57:06,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693282982] [2023-11-06 22:57:06,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:57:06,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-06 22:57:06,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:06,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-06 22:57:06,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1190, Unknown=84, NotChecked=234, Total=1806 [2023-11-06 22:57:06,425 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand has 43 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 43 states have internal predecessors, (93), 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:57:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:57:13,614 INFO L93 Difference]: Finished difference Result 220 states and 252 transitions. [2023-11-06 22:57:13,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-06 22:57:13,615 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 43 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-06 22:57:13,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:57:13,617 INFO L225 Difference]: With dead ends: 220 [2023-11-06 22:57:13,617 INFO L226 Difference]: Without dead ends: 219 [2023-11-06 22:57:13,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1081, Invalid=3624, Unknown=137, NotChecked=414, Total=5256 [2023-11-06 22:57:13,622 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 263 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 48 mSolverCounterUnsat, 66 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 66 IncrementalHoareTripleChecker+Unknown, 255 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 22:57:13,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 154 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 303 Invalid, 66 Unknown, 255 Unchecked, 1.7s Time] [2023-11-06 22:57:13,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-06 22:57:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 141. [2023-11-06 22:57:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 139 states have (on average 1.1798561151079137) internal successors, (164), 140 states have internal predecessors, (164), 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:57:13,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 164 transitions. [2023-11-06 22:57:13,655 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 164 transitions. Word has length 32 [2023-11-06 22:57:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:57:13,656 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 164 transitions. [2023-11-06 22:57:13,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 43 states have internal predecessors, (93), 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:57:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2023-11-06 22:57:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-06 22:57:13,658 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:57:13,658 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2023-11-06 22:57:13,666 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-06 22:57:13,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 22:57:13,866 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 22:57:13,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:13,867 INFO L85 PathProgramCache]: Analyzing trace with hash -959625036, now seen corresponding path program 1 times [2023-11-06 22:57:13,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:13,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826620641] [2023-11-06 22:57:13,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:13,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:57:13,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:13,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826620641] [2023-11-06 22:57:13,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826620641] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:57:13,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838771192] [2023-11-06 22:57:13,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:13,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:57:13,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:57:13,981 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:57:14,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:57:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:14,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:57:14,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:57:14,151 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-11-06 22:57:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:57:14,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:57:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-06 22:57:14,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838771192] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:57:14,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:57:14,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-11-06 22:57:14,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266672468] [2023-11-06 22:57:14,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:57:14,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:57:14,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:14,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:57:14,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:57:14,202 INFO L87 Difference]: Start difference. First operand 141 states and 164 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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:57:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:57:14,286 INFO L93 Difference]: Finished difference Result 210 states and 244 transitions. [2023-11-06 22:57:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:57:14,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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:57:14,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:57:14,289 INFO L225 Difference]: With dead ends: 210 [2023-11-06 22:57:14,290 INFO L226 Difference]: Without dead ends: 58 [2023-11-06 22:57:14,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:57:14,296 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:57:14,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:57:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-11-06 22:57:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-06 22:57:14,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 56 states have (on average 1.0714285714285714) internal successors, (60), 57 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:57:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2023-11-06 22:57:14,308 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 34 [2023-11-06 22:57:14,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:57:14,309 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2023-11-06 22:57:14,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 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:57:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2023-11-06 22:57:14,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-06 22:57:14,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:57:14,311 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:14,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-06 22:57:14,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:57:14,519 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 22:57:14,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:14,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1699783426, now seen corresponding path program 2 times [2023-11-06 22:57:14,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:14,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286770865] [2023-11-06 22:57:14,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:14,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:57:15,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286770865] [2023-11-06 22:57:15,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286770865] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:57:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794062958] [2023-11-06 22:57:15,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:57:15,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:57:15,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:57:15,969 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:57:15,988 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:57:16,143 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:57:16,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:57:16,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-06 22:57:16,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:57:16,181 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 22:57:16,200 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 24 treesize of output 1 [2023-11-06 22:57:16,220 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 22:57:16,235 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:57:16,236 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2023-11-06 22:57:16,245 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:57:16,246 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2023-11-06 22:57:16,256 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:57:16,271 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 22:57:16,287 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 24 treesize of output 1 [2023-11-06 22:57:16,307 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 22:57:16,319 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:57:16,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2023-11-06 22:57:16,330 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:57:16,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2023-11-06 22:57:16,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:57:16,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-06 22:57:16,380 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:57:16,406 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-06 22:57:16,423 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2023-11-06 22:57:16,440 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 30 treesize of output 1 [2023-11-06 22:57:16,449 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 30 treesize of output 1 [2023-11-06 22:57:17,831 INFO L322 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2023-11-06 22:57:17,831 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 257 treesize of output 225 [2023-11-06 22:57:17,849 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:57:17,880 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:57:17,998 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-06 22:57:17,998 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 24 [2023-11-06 22:57:18,089 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-06 22:57:18,213 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:57:18,241 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:57:18,338 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-06 22:57:18,461 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:57:18,498 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:57:18,606 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-06 22:57:18,728 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:57:18,778 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:57:18,890 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2023-11-06 22:57:19,007 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:57:19,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:57:19,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-11-06 22:57:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:57:19,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:57:26,067 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_529 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_33| Int) (|v_ULTIMATE.start_test_fun_#t~mem12#1_34| Int) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int) (|v_ULTIMATE.start_test_fun_#t~mem12#1_32| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_529) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_34| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_531) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_532) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_33| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_32| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_34|) (< (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_33|) (< (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_32|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) is different from false [2023-11-06 22:57:29,791 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 28 refuted. 44 times theorem prover too weak. 0 trivial. 8 not checked. [2023-11-06 22:57:29,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794062958] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:57:29,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:57:29,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 19] total 47 [2023-11-06 22:57:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859863560] [2023-11-06 22:57:29,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:57:29,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-06 22:57:29,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:57:29,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-06 22:57:29,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1506, Unknown=207, NotChecked=90, Total=2256 [2023-11-06 22:57:29,796 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 48 states, 47 states have (on average 2.7872340425531914) internal successors, (131), 48 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:34,251 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (select .cse3 0)) (.cse9 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0)) (.cse1 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse2 (not .cse9)) (.cse8 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse11 (exists ((v_DerPreprocessor_43 (Array Int Int)) (|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse6) .cse3))) (.cse7 (<= .cse6 0))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) .cse0) (not .cse1) (<= 1 .cse0) .cse2 (= (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (let ((.cse4 (and .cse2 .cse7))) (or (and (or .cse4 (and (exists ((v_DerPreprocessor_41 (Array Int Int)) (v_DerPreprocessor_42 (Array Int Int)) (|ULTIMATE.start_test_fun_~y#1| Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_41) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_42))) (and (= v_DerPreprocessor_41 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (= .cse3 (store (select (store .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse6))))) .cse7)) .cse8) (and (not .cse8) (or (and .cse9 (exists ((v_DerPreprocessor_48 (Array Int Int)) (v_DerPreprocessor_46 (Array Int Int)) (v_DerPreprocessor_47 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_46) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_47) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_48) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= v_DerPreprocessor_47 .cse10) (= (store .cse10 0 .cse6) .cse3)))) .cse7) (and .cse11 .cse2 .cse7))) (and (or .cse4 (and (exists ((|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_39 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_38) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_39))) (and (= (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|) v_DerPreprocessor_38) (= .cse3 (store (select (store .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse6))))) .cse7)) .cse1))) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (or (and .cse8 .cse7) (and .cse11 .cse7)))))) is different from true [2023-11-06 22:57:34,290 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) 0)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= |c_ULTIMATE.start_test_fun_~c~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) .cse0) (not (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (<= 1 .cse0) (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (= (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 0) (let ((.cse3 (select .cse1 0))) (let ((.cse2 (<= .cse3 0))) (or (and (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) .cse2) (and (exists ((v_DerPreprocessor_43 (Array Int Int)) (|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_45 (Array Int Int))) (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_43) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_44) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_45) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0 |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse3) .cse1)) .cse2)))))) is different from true [2023-11-06 22:57:36,182 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_531 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (v_ArrVal_532 (Array Int Int)) (v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_529 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_33| Int) (|v_ULTIMATE.start_test_fun_#t~mem12#1_34| Int) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int) (|v_ULTIMATE.start_test_fun_#t~mem12#1_32| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_529) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_34| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_531) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_532) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_33| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_32| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_34|) (< (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_33|) (< (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_32|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_33| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int) (v_ArrVal_532 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_32| Int)) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_532) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_33| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_32| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_33|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_32|)))))) (forall ((v_ArrVal_541 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int)) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int) (|v_ULTIMATE.start_test_fun_#t~mem12#1_32| Int)) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_32| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_32|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))) is different from false [2023-11-06 22:57:38,189 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_33| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int) (v_ArrVal_532 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_32| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_532) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_33| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_32| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_33|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_32|)))))) (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_541 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int) (|v_ULTIMATE.start_test_fun_#t~mem12#1_32| Int)) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_32| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_32|) (< (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (forall ((v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int)) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int) (|v_ULTIMATE.start_test_fun_#t~mem12#1_32| Int)) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_32| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_32|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))) is different from false [2023-11-06 22:57:38,200 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_33| Int) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int) (v_ArrVal_532 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_32| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_532) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_33| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_32| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_33|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_32|)))))) (forall ((v_ArrVal_541 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int)) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int) (|v_ULTIMATE.start_test_fun_#t~mem12#1_32| Int)) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_32| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_32|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)))))) is different from false [2023-11-06 22:57:39,382 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_541 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_535 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int) (|v_ULTIMATE.start_test_fun_#t~mem12#1_32| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_535) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_32| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_32|) (< (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2023-11-06 22:57:42,914 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_541 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2023-11-06 22:57:42,920 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_538 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_541 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem12#1_31| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_538) |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem12#1_31|) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |v_ULTIMATE.start_test_fun_#t~mem12#1_31| 1))) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2023-11-06 22:57:47,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:57:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:57:47,979 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2023-11-06 22:57:47,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-06 22:57:47,980 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.7872340425531914) internal successors, (131), 48 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2023-11-06 22:57:47,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:57:47,981 INFO L225 Difference]: With dead ends: 106 [2023-11-06 22:57:47,981 INFO L226 Difference]: Without dead ends: 105 [2023-11-06 22:57:47,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=901, Invalid=2628, Unknown=413, NotChecked=1170, Total=5112 [2023-11-06 22:57:47,985 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 71 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 35 mSolverCounterUnsat, 227 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 227 IncrementalHoareTripleChecker+Unknown, 643 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:57:47,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 126 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 294 Invalid, 227 Unknown, 643 Unchecked, 5.1s Time] [2023-11-06 22:57:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-06 22:57:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2023-11-06 22:57:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 93 states have (on average 1.075268817204301) internal successors, (100), 94 states have internal predecessors, (100), 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:57:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2023-11-06 22:57:48,006 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 45 [2023-11-06 22:57:48,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:57:48,006 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2023-11-06 22:57:48,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.7872340425531914) internal successors, (131), 48 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:57:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2023-11-06 22:57:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-06 22:57:48,009 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:57:48,009 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2023-11-06 22:57:48,017 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-06 22:57:48,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:57:48,217 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-06 22:57:48,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:57:48,217 INFO L85 PathProgramCache]: Analyzing trace with hash 385602730, now seen corresponding path program 3 times [2023-11-06 22:57:48,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:57:48,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112426115] [2023-11-06 22:57:48,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:57:48,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:57:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:57:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:57:50,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:57:50,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112426115] [2023-11-06 22:57:50,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112426115] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:57:50,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6126603] [2023-11-06 22:57:50,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:57:50,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:57:50,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:57:50,049 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:57:50,056 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b7592a5-778e-4c14-8628-faf161fde63f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:57:50,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-11-06 22:57:50,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:57:50,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-06 22:57:50,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:57:50,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 22:57:50,610 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:57:50,613 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2023-11-06 22:57:50,630 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:57:50,658 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 22:57:50,674 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:57:50,675 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2023-11-06 22:57:50,693 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 30 treesize of output 1 [2023-11-06 22:57:50,728 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-06 22:57:50,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:57:50,742 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2023-11-06 22:57:50,751 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:57:50,752 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2023-11-06 22:57:50,761 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:57:50,774 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-06 22:57:50,785 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:57:50,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2023-11-06 22:57:50,804 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 30 treesize of output 1 [2023-11-06 22:57:50,838 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-06 22:57:50,854 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 53 treesize of output 54 [2023-11-06 22:57:50,869 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 30 treesize of output 1 [2023-11-06 22:57:50,877 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:57:50,903 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-06 22:57:50,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2023-11-06 22:57:50,924 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:57:50,925 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2023-11-06 22:57:50,935 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:57:52,583 INFO L322 Elim1Store]: treesize reduction 50, result has 35.1 percent of original size [2023-11-06 22:57:52,584 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 177 treesize of output 172 [2023-11-06 22:57:52,610 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 36 treesize of output 18 [2023-11-06 22:57:52,625 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 29 treesize of output 13 [2023-11-06 22:57:52,668 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:57:52,675 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-06 22:57:52,877 INFO L322 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-11-06 22:57:52,877 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 57 [2023-11-06 22:57:52,909 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 15 treesize of output 11 [2023-11-06 22:57:53,096 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2023-11-06 22:57:53,384 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20 [2023-11-06 22:57:53,536 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:57:53,537 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2023-11-06 22:57:53,604 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-06 22:57:53,784 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2023-11-06 22:57:53,918 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:57:53,918 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2023-11-06 22:57:53,967 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-06 22:57:54,152 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2023-11-06 22:57:54,323 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:57:54,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2023-11-06 22:57:54,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-06 22:57:54,559 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2023-11-06 22:57:54,692 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:57:54,692 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2023-11-06 22:57:54,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-06 22:57:54,922 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2023-11-06 22:57:55,055 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:57:55,056 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2023-11-06 22:57:55,099 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-11-06 22:57:59,272 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:57:59,273 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 35 treesize of output 27 [2023-11-06 22:57:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:57:59,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:58:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 18 refuted. 120 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:58:13,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6126603] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:58:13,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:58:13,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 31] total 69 [2023-11-06 22:58:13,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075466498] [2023-11-06 22:58:13,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:58:13,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-11-06 22:58:13,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:58:13,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-11-06 22:58:13,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=911, Invalid=3292, Unknown=627, NotChecked=0, Total=4830 [2023-11-06 22:58:13,337 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 70 states, 69 states have (on average 2.391304347826087) internal successors, (165), 70 states have internal predecessors, (165), 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:58:17,485 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:58:21,641 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:58:28,119 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:58:28,138 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse14 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse4 (select .cse5 0)) (.cse6 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (not .cse6)) (.cse11 (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_52))) (and (= v_DerPreprocessor_50 (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse4) .cse5))))) (.cse7 (not .cse14)) (.cse9 (exists ((v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_65 (Array Int Int))) (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_63) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_64) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse4) .cse5))) (.cse1 (<= .cse4 0)) (.cse16 (select .cse15 0))) (and (let ((.cse8 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (not .cse8))) (or (and (or (and .cse0 .cse1) (and (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_61))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= v_DerPreprocessor_59 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store .cse3 0 .cse4) .cse5) (= v_DerPreprocessor_60 .cse3))))) .cse1)) .cse6) (and .cse7 (or (and .cse8 .cse1) (and .cse9 .cse1)) .cse10) (and (or (and .cse11 .cse0 .cse1) (and .cse8 .cse1 (exists ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_56))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= .cse12 v_DerPreprocessor_55) (= v_DerPreprocessor_54 (select .cse13 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse5 (store .cse12 0 .cse4)))))))) .cse14)))) (<= 1 (select .cse15 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) .cse7 (= (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0) .cse16) .cse10 (<= 1 .cse16) (or (and .cse11 .cse14 .cse1) (and .cse7 .cse9 .cse1)) (<= .cse16 |c_ULTIMATE.start_test_fun_#t~mem10#1|) (<= 1 |c_ULTIMATE.start_test_fun_#t~mem10#1|) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))))) is different from true [2023-11-06 22:58:28,160 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (select .cse5 0)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse8 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse6 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse13 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse7 (not .cse13)) (.cse9 (not .cse6)) (.cse0 (not .cse8)) (.cse16 (select .cse14 0)) (.cse1 (<= .cse4 0))) (and (or (and (or (and .cse0 .cse1) (and (exists ((v_DerPreprocessor_60 (Array Int Int)) (v_DerPreprocessor_61 (Array Int Int)) (v_DerPreprocessor_59 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_59) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_60) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_61))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= v_DerPreprocessor_59 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store .cse3 0 .cse4) .cse5) (= v_DerPreprocessor_60 .cse3))))) .cse1)) .cse6) (and .cse7 (or (and .cse8 .cse1) (and (exists ((v_DerPreprocessor_63 (Array Int Int)) (v_DerPreprocessor_64 (Array Int Int)) (v_DerPreprocessor_65 (Array Int Int))) (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_63) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_64) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_65) |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse4) .cse5)) .cse1)) .cse9) (and (or (and (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_50 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_50) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_51) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_52))) (and (= v_DerPreprocessor_50 (select .cse10 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (store (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|) 0 .cse4) .cse5)))) .cse0 .cse1) (and .cse8 .cse1 (exists ((v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int)) (v_DerPreprocessor_56 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_54) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_55) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_56))) (let ((.cse11 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (= .cse11 v_DerPreprocessor_55) (= v_DerPreprocessor_54 (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= .cse5 (store .cse11 0 .cse4)))))))) .cse13)) (<= 1 (select .cse14 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (or (let ((.cse15 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) 0))) (and (<= 1 .cse15) (<= .cse15 (+ 1 .cse16)))) (and (<= 0 .cse16) .cse13)) .cse7 (or (= 0 .cse16) (< 0 .cse16) .cse13) .cse9 .cse0 (<= .cse16 |c_ULTIMATE.start_test_fun_#t~mem10#1|) (<= 1 |c_ULTIMATE.start_test_fun_#t~mem10#1|) .cse1 (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))))) is different from true [2023-11-06 22:58:36,550 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:58:42,715 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]